Circumscribing datalog: Expressive power and complexity
- 28 February 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 193 (1-2) , 215-244
- https://doi.org/10.1016/s0304-3975(97)00108-4
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Multiple total stable models are definitely needed to solve unique solution problemsInformation Processing Letters, 1996
- The complexity of propositional closed world reasoning and circumscriptionJournal of Computer and System Sciences, 1994
- Why not negation by fixpoint?Journal of Computer and System Sciences, 1991
- Principles of database and knowledge-base systemsChoice Reviews Online, 1989
- Decidability and definability with circumscriptionAnnals of Pure and Applied Logic, 1987
- Fixed-point extensions of first-order logicAnnals of Pure and Applied Logic, 1986
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Complexity classes and theories of finite modelsTheory of Computing Systems, 1981
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980