Complexity and Expressive Power of Logic Programming

DMCA

Complexity and Expressive Power of Logic Programming (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

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

Citations:

359 - 52 self

BibTeX

@MISC{Dantsin97complexityand,
    author = {Evgeny Dantsin and Thomas Eiter and Georg Gottlob and Andrei Voronkov},
    title = {Complexity and Expressive Power of Logic Programming},
    year = {1997}
}

OpenURL

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.

Keyphrases

logic programming expressive power different form main focus pure horn clause program general logic disjunctive logic programming various important extension function symbol recent result propositional logic programming plain logic programming unification problem decidable form classical result constraint logic programming various complexity result

DMCA