Complexity and Expressive Power of Logic Programming

Complexity and Expressive Power of Logic Programming (1997)

by Evgeny Dantsin , Thomas Eiter , Georg Gottlob , Andrei Voronkov

Citations:

User correction supplied by mph

Datum	Value	Source
TITLE	Complexity and Expressive Power of Logic Programming	user correction - Legacy Corrections
AUTHOR NAME	Evgeny Dantsin	user correction
AUTHOR NAME	Thomas Eiter	user correction
AUTHOR NAME	Georg Gottlob	user correction
AUTHOR NAME	Andrei Voronkov	user correction
ABSTRACT	This paper surveys various complexity 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. The complexity of the unification problem is also addressed.	user correction
YEAR	1997	user correction - Legacy Corrections
CITATIONS	131 found	ParsCit 1.0