## Complexity and Expressive Power of Logic Programming (1997)

### Cached

### Download Links

- [www.kr.tuwien.ac.at]
- [www.kr.tuwien.ac.at]
- [www.kr.tuwien.ac.at]
- [ftp.kr.tuwien.ac.at]
- [ii.fmph.uniba.sk]
- DBLP

### Other Repositories/Bibliography

Citations: | 280 - 57 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}

}

### Years of Citing Articles

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