Probabilistic reasoning with answer sets

DOI10.1017/S1471068408003645zbMath1170.68003OpenAlexW2161403060MaRDI QIDQ3612603

Nelson Rushton, Michael Gelfond, Chitta R. Baral

Publication date: 10 March 2009

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

Full work available at URL: https://doi.org/10.1017/s1471068408003645

zbMATH Keywords

logic programmingprobabilistic reasoninganswer setsAnswer Set Prolog

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items (38)

Efficient Knowledge Compilation Beyond Weighted Model Counting ⋮ Learning Probabilistic Logic Programs over Continuous Data ⋮ Logic Programming with Graded Modality ⋮ A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions ⋮ Dialectical Proof Procedures for Probabilistic Abstract Argumentation ⋮ Unnamed Item ⋮ Causal inference in cplint ⋮ Dealing with explicit preferences and uncertainty in answer set programming ⋮ Hybrid answer set programming ⋮ Stable reasoning ⋮ Forecasting with jury-based probabilistic argumentation ⋮ Lifted inference for statistical statements in probabilistic answer set programming ⋮ Computing LP^MLN using ASP and MLN solvers ⋮ Random logic programs: Linear model ⋮ Probabilistic (logic) programming concepts ⋮ Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language ⋮ A landscape and implementation framework for probabilistic rough sets using \textsc{ProbLog} ⋮ Robot location estimation in the situation calculus ⋮ Answer-set programs for reasoning about counterfactual interventions and responsibility scores for classification ⋮ An application of answer set programming to the field of second language acquisition ⋮ Statistical statements in probabilistic logic programming ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ Semiring programming: a semantic framework for generalized sum product problems ⋮ Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems ⋮ Unnamed Item ⋮ Syntax and semantics of multi-adjoint normal logic programming ⋮ Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + ⋮ Complexity results for probabilistic answer set programming ⋮ The PITA system: Tabling and answer subsumption for reasoning under uncertainty ⋮ P-log: refinement and a new coherency condition ⋮ A Tool for Probabilistic Reasoning Based on Logic Programming and First-Order Theories Under Stable Model Semantics ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages ⋮ Abduction with probabilistic logic programming under the distribution semantics ⋮ Semantics for Possibilistic Disjunctive Programs ⋮ Typicalities and probabilities of exceptions in nonmotonic description logics ⋮ Possibilistic nested logic programs and strong equivalence ⋮ Quantitative Semantics for Uncertain Knowledge Bases ⋮ Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions

Cites Work

• Answering queries from context-sensitive probabilistic knowledge bases
• An analysis of first-order logics of probability
• ASSAT: computing answer sets of a logic program by SAT solvers
• The limitation of Bayesianism
• Probabilistic logic
• Probabilistic logic programming
• Probabilistic Horn abduction and Bayesian networks
• Stable semantics for probabilistic deductive databases
• The independent choice logic for modelling multiple agents under uncertainty
• Extending and implementing the stable model semantics
• Nested expressions in logic programs
• Markov logic networks
• Efficient top-down computation of queries under the well-founded semantics
• A new definition of SLDNF-resolution
• Logic programming and knowledge representation
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Abducing through negation as failure: stable models within the independent choice logic
• Weight constraints as nested expressions
• The DLV system for knowledge representation and reasoning
• Strongly equivalent logic programs
• Constructible falsity

This page was built for publication: Probabilistic reasoning with answer sets