Characterising equilibrium logic and nested logic programs: Reductions and complexity,
From MaRDI portal
Recommendations
Cites work
- A Characterization of Strong Equivalence for Logic Programs with Variables
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- A first order nonmonotonic extension of constructive logic
- A generalization of the Lin-Zhao theorem
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Autocircumscription
- Autoepistemic logic of first order and its expressive power
- Backjumping for quantified Boolean logic satisfiability
- Characterization of strongly equivalent logic programs in intermediate logics
- Circumscription - a form of non-monotonic reasoning
- Complete sets and the polynomial-time hierarchy
- Constructible falsity
- Equilibrium logic
- Extending and implementing the stable model semantics
- Intuitionistic logic with strong negation
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Negation as failure in the head
- Nested expressions in logic programs
- On Computing Belief Change Operations using Quantified Boolean Formulas
- On the computational cost of disjunctive logic programming: Propositional case
- On the relationship between circumscription and negation as failure
- On the relationship between CWA, minimal model, and minimal herbrand model semantics
- Propositional semantics for disjunctive logic programs
- Propositional theories are strongly equivalent to logic programs
- Reducing Preferential Paraconsistent Reasoning to Classical Entailment
- Safe beliefs for propositional theories
- Satisfiability in many-valued sentential logic is NP-complete
- Semantical characterizations and complexity of equivalences in answer set programming
- Semantical considerations on nonmonotonic logic
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- Strongly Equivalent Temporal Logic Programs
- Temporal Equilibrium Logic: A First Approach
- The DLV system for knowledge representation and reasoning
- The polynomial-time hierarchy
- The Problem of Simplifying Truth Functions
- The well-founded semantics for general logic programs
- Tight logic programs
Cited in
(12)- Disjunctive logic programs, answer sets, and the cut rule
- Forgetting auxiliary atoms in forks
- Model-based recasting in answer-set programming
- Dual-normal logic programs -- the forgotten class
- scientific article; zbMATH DE number 2085248 (Why is no real title available?)
- Epistemic logic programs: a different world view
- On uniform equivalence of epistemic logic programs
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
- A first polynomial non-clausal class in many-valued logic
- On Heuer's procedure for verifying strong equivalence
- Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic
This page was built for publication: Characterising equilibrium logic and nested logic programs: Reductions and complexity,
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181745)
