The PITA system: Tabling and answer subsumption for reasoning under uncertainty

DOI10.1017/S147106841100010XzbMath1218.68169DBLPjournals/tplp/RiguzziS11arXiv1107.4747OpenAlexW1983128223WikidataQ58063789 ScholiaQ58063789MaRDI QIDQ3087434

Fabrizio Riguzzi, Terrance Swift

Publication date: 16 August 2011

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.4747

zbMATH Keywords

program transformationtablingprobabilistic logic programmingpossibilistic logic programminganswer subsumption

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)

Related Items (25)

Efficient Knowledge Compilation Beyond Weighted Model Counting ⋮ The distribution semantics for normal programs with function symbols ⋮ Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics ⋮ \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs ⋮ Constraint-Based Inference in Probabilistic Logic Programs ⋮ A functional account of probabilistic programming with possible worlds. Declarative pearl ⋮ Infinite probability computation by cyclic explanation graphs ⋮ Unnamed Item ⋮ Causal inference in cplint ⋮ Lifted inference for statistical statements in probabilistic answer set programming ⋮ Viterbi training in PRISM ⋮ Structure learning of probabilistic logic programs by searching the clause space ⋮ Probabilistic (logic) programming concepts ⋮ Bandit-based Monte-Carlo structure learning of probabilistic logic programs ⋮ Lifted discriminative learning of probabilistic logic programs ⋮ An OpenCL implementation of a forward sampling algorithm for CP-logic ⋮ Learning Effect Axioms via Probabilistic Logic Programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ MAP Inference for Probabilistic Logic Programming ⋮ Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach ⋮ Probabilistic abstract argumentation frameworks, a possible world view ⋮ PITA ⋮ Learning hierarchical probabilistic logic programs ⋮ Unnamed Item

Uses Software

• ProbLog
• B-Prolog
• XSB

Cites Work

• Possibilistic logic: a retrospective and prospective view
• Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
• Possibilistic uncertainty handling for answer set programming
• The independent choice logic for modelling multiple agents under uncertainty
• Tabling for non-monotonic programming
• Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
• Probabilistic reasoning with answer sets
• Extended semantics and inference for the Independent Choice Logic
• Abducing through negation as failure: stable models within the independent choice logic
• Non-discriminating Arguments and Their Uses
• Semantics for Possibilistic Disjunctive Programs
• On the Efficient Execution of ProbLog Programs
• Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics

This page was built for publication: The PITA system: Tabling and answer subsumption for reasoning under uncertainty