Evaluating epistemic negation in answer set programming
From MaRDI portal
(Redirected from Publication:286399)
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
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 67490 (Why is no real title available?)
- Answer sets for logic programs with arbitrary abstract constraint atoms
- Autoepistemic logic
- Combining answer set programming with description logics for the semantic web
- Equilibrium logic
- FLP answer set semantics without circular justifications for general logic programs
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic programming and reasoning with incomplete information
- Logic programming with graded modality
- Manifold answer-set programs and their applications
- Nested expressions in logic programs
- New semantics for epistemic specifications
- On the computational cost of disjunctive logic programming: Propositional case
- Reconciling description logics and rules
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Revisiting Epistemic Specifications
- Semantics and complexity of recursive aggregates in answer set programming
- Stable models and circumscription
- The Semantics of Predicate Logic as a Programming Language
- The language of epistemic specifications (refined) including a prototype solver
- Thirteen Definitions of a Stable Model
- Well-founded and stable semantics of logic programs with aggregates
Cited in
(19)- Complexity of the multilevel critical node problem
- Autoepistemic answer set programming
- Belnap's epistemic states and negation-as-failure
- Thirty years of Epistemic Specifications
- selp: a single-shot epistemic logic program solver
- Synthesis of modality definitions and a theorem prover for epistemic intuitionistic logic
- Epistemic logic programs: a study of some properties
- A parallel memory-efficient epistemic logic program solver: harder, better, faster
- Utilizing treewidth for quantitative reasoning on epistemic logic programs
- Refining the semantics of epistemic specifications
- About epistemic negation and world views in epistemic logic programs
- scientific article; zbMATH DE number 2134137 (Why is no real title available?)
- Autoepistemic equilibrium logic and epistemic specifications
- scientific article; zbMATH DE number 67490 (Why is no real title available?)
- On uniform equivalence of epistemic logic programs
- Determining inference semantics for disjunctive logic programs
- scientific article; zbMATH DE number 7455722 (Why is no real title available?)
- scientific article; zbMATH DE number 7453102 (Why is no real title available?)
- 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)
