Complexity and expressive power of logic programming

  • Authors:
  • Evgeny Dantsin;Thomas Eiter;Georg Gottlob;Andrei Voronkov

  • Affiliations:
  • Roosevelt University, Chicago, IL, USA;Vienna University of Technology, Vienna, Austria;Vienna University of Technology, Vienna, Austria;University of Manchester, Manchester, United Kingdom

  • Venue:
  • ACM Computing Surveys (CSUR)
  • Year:
  • 2001

Quantified Score

Hi-index 0.02

Visualization

Abstract

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 with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming.