The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries
- 1 June 1997
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 54 (3) , 441-464
- https://doi.org/10.1006/jcss.1997.1446
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Multiple total stable models are definitely needed to solve unique solution problemsInformation Processing Letters, 1996
- On the equivalence of semantics for normal logic programsThe Journal of Logic Programming, 1995
- A survey of complexity results for non-monotonic logicsThe Journal of Logic Programming, 1993
- Short note preferred extensions are partial stable modelsThe Journal of Logic Programming, 1992
- Why not negation by fixpoint?Journal of Computer and System Sciences, 1991
- Negation in rule-based database languages: a surveyTheoretical Computer Science, 1991
- Procedural languages for database queries and updatesJournal of Computer and System Sciences, 1990
- Negation as failure using tight derivations for general logic programsThe Journal of Logic Programming, 1989
- The complexity of facets (and some facets of complexity)Journal of Computer and System Sciences, 1984
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982