Complexity and expressive power of logic programming
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 97 references indexed in Scilit:
- A note on semantics of logic programs with equality based on complete sets of E-unifiersThe Journal of Logic Programming, 1996
- A possible world semantics for disjunctive databasesIEEE Transactions on Knowledge and Data Engineering, 1993
- Computational complexity and constraint logic programming languagesAnnals of Mathematics and Artificial Intelligence, 1992
- Hypothetical datalog: complexity and expressibilityTheoretical Computer Science, 1990
- Generalized Closed World Assumption is II02-CompleteInformation Processing Letters, 1990
- Skolem normal forms concerning the least fixpointPublished by Springer Nature ,1987
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- The recursion-theoretic complexity of the semantics of predicate logic as a programming languageInformation and Control, 1982
- AlternationJournal of the ACM, 1981