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 条
  • [41] Preferred answer sets for ordered logic programs
    Van Nieuwenborgh, D
    Vermeir, D
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2006, 6 : 107 - 167
  • [42] A space efficient engine for subsumption-based tabled evaluation of logic programs
    Johnson, E
    Ramakrishnan, CR
    Ramakrishnan, LV
    Rao, P
    FUNCTIONAL AND LOGIC PROGRAMMING, PROCEEDINGS, 1999, 1722 : 284 - 299
  • [43] Rough set reasoning using answer set programs
    Doherty, Patrick
    Szalas, Andrzej
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2021, 130 : 126 - 149
  • [44] Guiding reinvention of conventional tools of mathematical logic: students’ reasoning about mathematical disjunctions
    Paul Christian Dawkins
    John Paul Cook
    Educational Studies in Mathematics, 2017, 94 : 241 - 256
  • [45] Guiding reinvention of conventional tools of mathematical logic: students' reasoning about mathematical disjunctions
    Dawkins, Paul Christian
    Cook, John Paul
    EDUCATIONAL STUDIES IN MATHEMATICS, 2017, 94 (03) : 241 - 256
  • [46] ON THE RELATIONSHIP BETWEEN ANNOTATED LOGIC PROGRAMS AND NONMONOTONIC FORMALISMS
    THIRUNARAYAN, K
    JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 1995, 7 (04) : 391 - 406
  • [47] Coherent well-founded annotated logic programs
    Damásio, CV
    Pereira, LM
    Swift, T
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1999, 1730 : 262 - 276
  • [48] Reasoning with uncertainty in deductive databases and logic programs
    Ng, RT
    INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 1997, 5 (03) : 261 - 316
  • [49] Plausible Description Logic Programs for Stream Reasoning
    Groza, Adrian
    Letia, Ioan Alfred
    FUTURE INTERNET, 2012, 4 (04): : 865 - 881
  • [50] DESCRIPTION PLAUSIBLE LOGIC PROGRAMS FOR STREAM REASONING
    Letia, Ioan Alfred
    Groza, Adrian
    ICAART: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, 2012, : 560 - 566
12345