Characterising equilibrium logic and nested logic programs: Reductions and complexity,

DOI10.1017/S147106840999010XzbMath1186.68100OpenAlexW3100069569MaRDI QIDQ3181745

No author found.

Publication date: 12 October 2009

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

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

zbMATH Keywords

computational complexityequilibrium logicquantified Boolean formulasanswer-set programmingreduction techniquesequivalence testing

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (9)

Model-based recasting in answer-set programming ⋮ Dual-normal logic programs – the forgotten class ⋮ A first polynomial non-clausal class in many-valued logic ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ Unnamed Item ⋮ Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets ⋮ Forgetting auxiliary atoms in forks ⋮ Disjunctive logic programs, answer sets, and the cut rule ⋮ Quantified Equilibrium Logic and Foundations for Answer Set Programs

Uses Software

• ASSAT

Cites Work

• A first order nonmonotonic extension of constructive logic
• Backjumping for quantified Boolean logic satisfiability
• A generalization of the Lin-Zhao theorem
• Equilibrium logic
• Semantical considerations on nonmonotonic logic
• Satisfiability in many-valued sentential logic is NP-complete
• Autocircumscription
• On the relationship between circumscription and negation as failure
• Circumscription - a form of non-monotonic reasoning
• The polynomial-time hierarchy
• Intuitionistic logic with strong negation
• Complete sets and the polynomial-time hierarchy
• Autoepistemic logic of first order and its expressive power
• Extending and implementing the stable model semantics
• Safe beliefs for propositional theories
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional semantics for disjunctive logic programs
• Nested expressions in logic programs
• On the relationship between CWA, minimal model, and minimal herbrand model semantics
• Temporal Equilibrium Logic: A First Approach
• Strongly Equivalent Temporal Logic Programs
• Negation as failure in the head
• The well-founded semantics for general logic programs
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Reducing Preferential Paraconsistent Reasoning to Classical Entailment
• Characterization of strongly equivalent logic programs in intermediate logics
• On Computing Belief Change Operations using Quantified Boolean Formulas
• Tight logic programs
• Strong equivalence made easy: nested expressions and weight constraints
• The DLV system for knowledge representation and reasoning
• Semantical characterizations and complexity of equivalences in answer set programming
• A Characterization of Strong Equivalence for Logic Programs with Variables
• Propositional theories are strongly equivalent to logic programs
• Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Strongly equivalent logic programs
• Constructible falsity
• The Problem of Simplifying Truth Functions

This page was built for publication: Characterising equilibrium logic and nested logic programs: Reductions and complexity,