Complexity and expressive power of logic programming
Top Cited Papers
- 1 September 2001
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 33 (3), 374-425
- https://doi.org/10.1145/502807.502810
Abstract
No abstract availableKeywords
This publication has 191 references indexed in Scilit:
- On the Equivalence of Recursive and Nonrecursive Datalog ProgramsJournal of Computer and System Sciences, 1997
- Extending Datalog with arraysData & Knowledge Engineering, 1995
- The power of languages for the manipulation of complex valuesThe VLDB Journal, 1995
- Computing with First-Order LogicJournal of Computer and System Sciences, 1995
- Datalog vs first-order logicJournal of Computer and System Sciences, 1994
- Domain independence and the relational calculusActa Informatica, 1994
- Negation by default and unstratifiable logic programsTheoretical Computer Science, 1991
- Negation in rule-based database languages: a surveyTheoretical Computer Science, 1991
- Data independent recursion in deductive databasesJournal of Computer and System Sciences, 1989
- On recursive axioms in deductive databasesInformation Systems, 1983