Evaluating epistemic negation in answer set programming

DOI10.1016/J.ARTINT.2016.04.004zbMATH Open1358.68278OpenAlexW2345230773MaRDI QIDQ286399FDOQ286399

Yi-Dong Shen, Thomas Eiter

Publication date: 20 May 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2016.04.004

Recommendations

• Revisiting explicit negation in answer set programming
• Epistemic answer set programming
• About epistemic negation and world views in epistemic logic programs
• Negation as a resource: a novel view on answer set semantics
• Negation as a resource: a novel view on answer set semantics
• Autoepistemic answer set programming
• An epistemic model of logic programming
• On Negative Unfolding in the Answer Set Semantics
• Answer Set Programming without Unstratified Negation
• Epistemic logic programs: a study of some properties

zbMATH Keywords

answer set programmingsemanticsepistemic negation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Logics of knowledge and belief (including belief change) (03B42) Logic programming (68N17) Logic in artificial intelligence (68T27)

Cites Work

• On the computational cost of disjunctive logic programming: Propositional case
• Nested expressions in logic programs
• Combining answer set programming with description logics for the semantic web
• Title not available (Why is that?)
• Semantics and complexity of recursive aggregates in answer set programming
• Logic Programming and Nonmonotonic Reasoning
• Equilibrium logic
• Logic programming and reasoning with incomplete information
• FLP answer set semantics without circular justifications for general logic programs
• Manifold Answer-Set Programs and Their Applications
• Revisiting Epistemic Specifications
• New Semantics for Epistemic Specifications
• The language of epistemic specifications (refined) including a prototype solver
• Well-founded and stable semantics of logic programs with aggregates
• Logic Programming with Graded Modality
• Reconciling description logics and rules
• Thirteen Definitions of a Stable Model
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Semantics of Predicate Logic as a Programming Language
• Autoepistemic logic
• Stable models and circumscription
• Logic Programming and Nonmonotonic Reasoning
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs

Cited In (19)

• A parallel memory-efficient epistemic logic program solver: harder, better, faster
• Title not available (Why is that?)
• Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
• Belnap's epistemic states and negation-as-failure
• Epistemic logic programs: a study of some properties
• On Uniform Equivalence of Epistemic Logic Programs
• Synthesis of modality definitions and a theorem prover for epistemic intuitionistic logic
• About Epistemic Negation and World Views in Epistemic Logic Programs
• Title not available (Why is that?)
• Complexity of the multilevel critical node problem
• Thirty years of Epistemic Specifications
• Title not available (Why is that?)
• selp: A Single-Shot Epistemic Logic Program Solver
• Title not available (Why is that?)
• Autoepistemic answer set programming
• Autoepistemic equilibrium logic and epistemic specifications
• Refining the semantics of epistemic specifications
• Determining inference semantics for disjunctive logic programs
• Epistemic logic programs: a study of some properties

This page was built for publication: Evaluating epistemic negation in answer set programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286399)