Complexity and expressive power of logic programming

@article{Dantsin2001ComplexityAE,
  title={Complexity and expressive power of logic programming},
  author={E. Dantsin and Thomas Eiter and G. Gottlob and A. Voronkov},
  journal={ACM Comput. Surv.},
  year={2001},
  volume={33},
  pages={374-425}
}
  • E. Dantsin, Thomas Eiter, +1 author A. Voronkov
  • Published 2001
  • Computer Science
  • ACM Comput. Surv.
  • 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… CONTINUE READING
    559 Citations

    Topics from this paper.

    Disjunctive Logic Programs versus Normal Logic Programs
    • 1
    • PDF
    First-Order Disjunctive Logic Programming vs Normal Logic Programming
    • Yi Zhou
    • Computer Science
    • IJCAI
    • 2015
    • 4
    • PDF
    Expressiveness of Logic Programs under the General Stable Model Semantics
    Probabilistic logic programming with conditional constraints
    • 106
    Logic programming and cardinality constraints : theory and practice
    • 14
    Logic Programming Applications: What Are the Abstractions and Implementations?
    • Y. Liu
    • Computer Science
    • Declarative Logic Programming
    • 2018
    • 1
    • PDF
    Probabilistic and truth-functional many-valued logic programming
    • Thomas Lukasiewicz
    • Computer Science
    • Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)
    • 1999
    • 16
    • PDF
    Cardinality Constraint Programs
    • 20

    References

    SHOWING 1-10 OF 27 REFERENCES
    The Expressive Powers of the Logic Programming Semantics
    • J. Schlipf
    • Computer Science
    • J. Comput. Syst. Sci.
    • 1995
    • 160
    • Highly Influential
    The complexity of relational query languages (Extended Abstract)
    • 1,427
    • Highly Influential
    Computing with First-Order Logic
    • 95
    • Highly Influential
    • PDF
    On the Sequential Nature of Unification
    • 232
    • Highly Influential
    • PDF
    The well-founded semantics for general logic programs
    • 1,843
    • Highly Influential
    • PDF
    Languages for relational databases over interpreted structures
    • 43
    • Highly Influential
    • PDF
    Foundations of Databases
    • 4,139
    • Highly Influential
    • PDF
    On Indefinite Databases and the Closed World Assumption
    • J. Minker
    • Mathematics, Computer Science
    • CADE
    • 1982
    • 574
    • Highly Influential
    A Machine-Oriented Logic
    • Based on the Resolution-Principle.JACM,
    • 1965
    Alternation
    • Journal of the Association for Computing Machinery 28, 1 (Jan.), 114–133.
    • 1981