TABLING AND ANSWER SUBSUMPTION FOR REASONING ON LOGIC PROGRAMS WITH ANNOTATED DISJUNCTIONS

被引：22

作者：

Riguzzi, Fabrizio ^{[1
]}

Swift, Terrance ^{[1
]}

机构：

[1] Univ Ferrara, ENDIF, Via Saragat 1, Ferrara, Italy

来源：

TECHNICAL COMMUNICATIONS OF THE 26TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP'10) | 2010年 / 7卷

关键词：

D O I：

10.4230/LIPIcs.ICLP.2010.162

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The paper presents the algorithm "Probabilistic Inference with Tabling and Answer subsumption" (PITA) for computing the probability of queries from Logic Programs with Annotated Disjunctions. PITA is based on a program transformation techniques that adds an extra argument to every atom. PITA uses tabling for saving intermediate results and answer subsumption for combining different answers for the same subgoal. PITA has been implemented in XSB and compared with the ProbLog, cplint and CVE systems. The results show that in almost all cases, PITA is able to solve larger problems and is faster than competing algorithms.

引用

页码：162 / 171

页数：10

共 50 条

[31] Witnesses for Answer Sets of Logic Programs
Wang, Yisong
Eiter, Thomas
Zhang, Yuanlin
Lin, Fangzhen
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2023, 24 (02)
[32] A characterization of answer sets for logic programs
MingYi Zhang
Ying Zhang
FangZhen Lin
Science in China Series F: Information Sciences, 2007, 50 : 46 - 62
[33] It is declarative - On reasoning about logic programs
Drabent, W
LOGIC PROGRAMMING: PROCEEDINGS OF THE 1999 INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING, 1999, : 607 - 607
[34] Analysing logic programs by reasoning backwards
Howe, JM
King, A
Lu, LJ
PROGRAM DEVELOPMENT IN COMPUTATIONAL LOGIC: A DECADE OF RESEARCH ADVANCES IN LOGIC-BASED PROGRAM DEVELOPMENT, 2004, 3049 : 152 - 188
[35] Reasonings based on vector annotated logic programs
Nakamatsu, K
Abe, JM
COMPUTATIONAL INTELLIGENCE FOR MODELLING, CONTROL & AUTOMATION - EVOLUTIONARY COMPUTATION & FUZZY LOGIC FOR INTELLIGENT CONTROL, KNOWLEDGE ACQUISITION & INFORMATION RETRIEVAL, 1999, 55 : 396 - 403
[36] Hybrid Reasoning with Forest Logic Programs
Feier, Cristina
Heymans, Stijn
SEMANTIC WEB: RESEARCH AND APPLICATIONS, 2009, 5554 : 338 - 352
[37] Resilient Logic Programs: Answer Set Programs Challenged by Ontologies
Lukumbuzya, Sanja
Ortiz, Magdalena
Simkus, Mantas
THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 2917 - 2924
[38] Preferred answer sets for extended logic programs
Brewka, G
Eiter, T
ARTIFICIAL INTELLIGENCE, 1999, 109 (1-2) : 297 - 356
[39] Combining answer sets of nonmonotonic logic programs
Sakama, Chiaki
Inoue, Katsumi
COMPUTATIONAL LOGIC IN MULTI-AGENT SYSTEMS, 2006, 3900 : 320 - 339
[40] Preferred answer sets for ordered logic programs
Van Nieuwenborgh, D
Vermeir, D
LOGICS IN ARTIFICIAL INTELLIGENCE 8TH, 2002, 2424 : 432 - 443

← 1 2 3 4 5 →