# Complexity and expressive power of logic programming

@article{Dantsin2001ComplexityAE, title={Complexity and expressive power of logic programming}, author={Evgeny Dantsin and Thomas Eiter and Georg Gottlob and Andrei Voronkov}, journal={ACM Comput. Surv.}, year={2001}, volume={33}, pages={374-425} }

This article surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming… Expand

#### Topics from this paper

#### 615 Citations

Disjunctive Logic Programs versus Normal Logic Programs

- Computer Science
- ArXiv
- 2013

A translation from disjunctive logic programs into normal logic programs is proposed and then proved to be sound over infinite structures and 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 under complement. Expand

First-Order Disjunctive Logic Programming vs Normal Logic Programming

- Computer Science
- IJCAI
- 2015

A partial translation from first-order DLP to NLP via unfolding and shifting is proposed, which suggests a sound yet incomplete approach to implement DLP via NLP solvers, and some NLP definable subclasses are identified, and conjecture to exactly capture NLP Definability by unfolding and shifts is conjecture. Expand

Expressiveness of Logic Programs under the General Stable Model Semantics

- Mathematics, Computer Science
- ACM Trans. Comput. Log.
- 2017

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. Expand

Probabilistic logic programming with conditional constraints

- Mathematics, Computer Science
- TOCL
- 2001

It is shown that probabilistic logic programming under certain syntactic and semantic restrictions is closely related to van Emden's quantitative deduction, and thus has computational properties similar to calssical logic programming. Expand

Complexity Results for Checking Equivalence of Stratified Logic Programs

- Mathematics, Computer Science
- IJCAI
- 2007

This paper considers the important classes of stratified programs and its subclass of acyclic programs, and shows that in the propositional setting, deciding strong and uniform equivalence is as hard as for arbitrary normal logic programs (and thus coNP-complete), but is polynomial in some restricted cases. Expand

Logic programming and cardinality constraints : theory and practice

- Mathematics
- 2009

Answer set programming (ASP) is a method for solving hard problems using computational logic. We describe a problem as a set of formulas of a declarative logical language in such way that the… Expand

Probabilistic and truth-functional many-valued logic programming

- Computer Science
- Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)
- 1999

Surprisingly, many-valued logic programs in Pr/sub n/* have both a probabilistic semantics in probabilities over a set of possible worlds and a truth-functional semantics in the finite-valued Lukasiewicz logics L/ sub n/. Expand

Probabilistic Logic Programming with Conditional Constraints Probabilistic Logic Programming with Conditional Constraints Revised Version, May 2000

- Computer Science
- 2000

It is shown that probabilistic logic programming under certain syntactic and semantic restrictions is close ly related to van Emden’s quantitative deduction, and thus has computational properties similar to c lassical logic programming. Expand

Cardinality Constraint Programs

- Computer Science
- JELIA
- 2004

It is shown how the formal semantics of the class of cardinality constraint logic programs can be extended to allow the use of evaluated function symbols, such as arithmetic built-in operators, in the Smodels system. Expand

Logic programming applications: what are the abstractions and implementations?

- Computer Science
- Declarative Logic Programming
- 2018

This chapter presents an overview of applications of logic programming, classifying them based on the abstractions and implementations of logic languages that support the applications. The three key… Expand

#### References

SHOWING 1-10 OF 417 REFERENCES

Complexity and expressive power of logic programming

- Computer Science
- 2001

This article surveys various complexity and expressiveness results on different forms of logic programming, in particular, propositional logic programming and its variants. Expand

Complexity and expressive power of logic programming

- Mathematics, Computer Science
- Proceedings of Computational Complexity. Twelfth Annual IEEE Conference
- 1997

The main focus is on decidable forms of logic programming, in particular propositional logic programming and datalog, but the also mention general logic programming with function symbols, and the complexity of the unification problem is addressed. Expand

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions

- Computer Science, Mathematics
- J. Log. Program.
- 1997

This result is surprising because it shows that disjunctive logic programming is not more expressive than normal logic programming under the stable or well-founded semantics, and sharply contrasts with the function-free case. Expand

Generalized Quantifiers in Logic Programs

- Mathematics, Computer Science
- ESSLLI
- 1997

It appears that modular logic programming has the expressive power of second-order logic and captures the polynomial hierarchy, and different natural syntactical fragments capture the classes therein. Expand

Logic Programming and Parallel Complexity

- Computer Science
- ICDT
- 1986

This paper highlights the fact that all of these results can be stated using the stage function sH(n) of a program H, where n is the size of the database queried, and presents two new observations. Expand

Horn Clauses Queries and Generalizations

- Computer Science, Mathematics
- J. Log. Program.
- 1985

It is shown that logic programs express precisely the queries in YE + (the set of queries representable by a fixpoint applied to a positive existential query), and the resulting class has the expressive power of universally quantified second-order logic. Expand

Logic Programming and Knowledge Representation

- Computer Science, Mathematics
- J. Log. Program.
- 1994

This paper considers extensions of the language of definite logic programs by classical (strong) negation, disjunction, and some modal operators and shows how each of the added features extends the representational power of thelanguage. Expand

Semantics for Disjunctive Logic Programs with Explicit and Default Negation

- Mathematics, Computer Science
- Fundam. Informaticae
- 1994

This work studies the semantics of disjunctive programs that contain both explicit negation and negation-by-default, called extended disJunctive logic programs, and general techniques are described for extending model, fixpoint, and proof theoretic characterizations of an arbitrary semantics of normal disjunctions logic programs to cover the class of extended programs. Expand

Unification as a Complexity Measure for Logic Programming

- Computer Science, Mathematics
- J. Log. Program.
- 1987

A faithful simulation theorem is proved which associates with every k -tape Turing machine a Horn clause program requiring exactly as many unification steps as the Turing machine, and it follows that Horn clause programs are computationally complete even in the case of bi-Horn (=Krom) formulas. Expand

The expressive powers of the logic programming semantics (extended abstract)

- Mathematics, Computer Science
- PODS '90
- 1990

In this sense of uniform translatability, the well-founded semantics is shown to be more expressive than the 3-valued program completion and well- founded semantics over infinite Herbrand models. Expand