Propositional semantics for disjunctive logic programs

  title={Propositional semantics for disjunctive logic programs},
  author={R. Ben-Eliyahu-Zohary and R. Dechter},
  journal={Annals of Mathematics and Artificial Intelligence},
  • R. Ben-Eliyahu-Zohary, R. Dechter
  • Published 2005
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • In this paper we study the properties of the class of head-cycle-free extended disjunctive logic programs (HEDLPs), which includes, as a special case, all nondisjunctive extended logic programs. We show that any propositional HEDLP can be mapped in polynomial time into a propositional theory such that each model of the latter corresponds to an answer set, as defined by stable model semantics, of the former. Using this mapping, we show that many queries over HEDLPs can be determined by solving… CONTINUE READING
    216 Citations
    On the computational cost of disjunctive logic programming: Propositional case
    • 293
    • Highly Influenced
    On Eliminating Disjunctions in Stable Logic Programming
    • 23
    • PDF
    Characterising equilibrium logic and nested logic programs: Reductions and complexity,
    • 25
    • PDF
    Expressiveness of Logic Programs under the General Stable Model Semantics
    • PDF
    Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
    • 2
    • PDF
    Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
    • 76
    • Highly Influenced
    Complexity Results for Checking Equivalence of Stratified Logic Programs
    • 11
    • PDF
    Comparing Disjunctive Well-founded Semantics
    • PDF
    Uniform Equivalence of Logic Programs under the Stable Model Semantics
    • 111
    • PDF


    Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
    • 76
    • Highly Influential
    A Fixpoint Semantics for Disjunctive Logic Programs
    • 122
    • PDF
    On the declarative and procedural semantics of logic programs
    • 70
    Inference in inheritance networks using propositional logic and constraint networks techniques
    • 1
    Towards a Theory of Declarative Knowledge
    • 1,389
    • PDF
    WFS + Branch and Bound = Stable Models
    • 82
    • PDF
    Computing Intersection of Autoepistemic Expansions
    • 53
    The Justification of Negation as Failure
    • 21
    It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics
    • 60
    • PDF