• Corpus ID: 3749328

Disjunctive Logic Programs versus Normal Logic Programs

  title={Disjunctive Logic Programs versus Normal Logic Programs},
  author={Heng Zhang and Yan Zhang},
This paper focuses on the expressive power of disjunctive and normal logic programs under the stable model semantics over finite, infinite, or arbitrary structures. A translation from disjunctive logic programs into normal logic programs is proposed and then proved to be sound over infinite structures. The equivalence of expressive power of two kinds of logic programs over arbitrary structures is shown to coincide with that over finite structures, and coincide with whether or not NP is closed… 
1 Citations
Expressiveness of Logic Programs under the General Stable Model Semantics
The equivalence of the expressiveness of normal logic programs and disjunctive logic programs over arbitrary structures is shown to coincide with that over finite structures and coincide with whether the complexity class NP is closed under complement.


Propositional semantics for disjunctive logic programs
It is shown 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.
First-Order Expressibility and Boundedness of Disjunctive Logic Programs
In this paper, the fixed point semantics developed in [Lobo et al., 1992] is generalized to disjunctive logic programs with default negation and over arbitrary structures, and proved to coincide with
Complexity and expressive power of logic programming
This article surveys various complexity and expressiveness results on different forms of logic programming, in particular, propositional logic programming and datalog, but it also mentions general logic programming with function symbols.
Reducing Propositional Theories in Equilibrium Logic to Logic Programs
The paper shows how to effectively obtain an equivalent program starting from an arbitrary theory and shows that in general there is no polynomial time transformation if the authors require the resulting program to share precisely the vocabulary or signature of the initial theory.
The Expressive Powers of the Logic Programming Semantics
  • J. Schlipf
  • Computer Science
    J. Comput. Syst. Sci.
  • 1995
The proof is a corollary of the result that over non-Herbrand infinite models, the well-founded semantics is more expressive than the three-valued program completion semantics, which is in a sense uniform in the strata.
Symmetric Splitting in the General Theory of Stable Models
This work discusses two kinds of splitting: a set of intensional predicates can be split into subsets, and a formula can besplit into its conjunctive terms.
Foundations of disjunctive logic programming
This paper discusses first-order theory - syntax first order theory - semantics logic programs - syntax Logic programs - semantics - models and interpretations substitutions and unifiers fixpoint theory, a comparison of definite and disjunctive logic programs and normal logic programs.
Disjunctive datalog
It is demonstrated that problems relevant in practice such as computing the optimal tour value in the Traveling Salesman Problem and eigenvector computations can be handled in disjunctive Datalog, but not Datalogs with negation (unless the Polynomial Hierarchy collapses).