Evaluating epistemic negation in answer set programming
From MaRDI portal
Publication:286399
DOI10.1016/j.artint.2016.04.004zbMath1358.68278OpenAlexW2345230773MaRDI QIDQ286399
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
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Knowledge representation (68T30) Logic programming (68N17)
Related Items (14)
Complexity of the multilevel critical node problem ⋮ Thirty years of Epistemic Specifications ⋮ About Epistemic Negation and World Views in Epistemic Logic Programs ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ Epistemic logic programs: a study of some properties ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Determining inference semantics for disjunctive logic programs ⋮ selp: A Single-Shot Epistemic Logic Program Solver ⋮ Autoepistemic answer set programming ⋮ Autoepistemic equilibrium logic and epistemic specifications ⋮ A parallel memory-efficient epistemic logic program solver: harder, better, faster ⋮ Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs ⋮ Synthesis of modality definitions and a theorem prover for epistemic intuitionistic logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stable models and circumscription
- Semantics and complexity of recursive aggregates in answer set programming
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Equilibrium logic
- On the computational cost of disjunctive logic programming: Propositional case
- Logic programming and reasoning with incomplete information
- Nested expressions in logic programs
- Combining answer set programming with description logics for the semantic web
- 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
- The Semantics of Predicate Logic as a Programming Language
- Autoepistemic logic
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
This page was built for publication: Evaluating epistemic negation in answer set programming
