Querying disjunctive databases through nonmonotonic logics
- 10 June 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 160 (1-2) , 321-363
- https://doi.org/10.1016/0304-3975(95)00192-1
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Autoepistemic logics as a unifying framework for the semantics of logic programsThe Journal of Logic Programming, 1995
- Autoepistemic logic programmingJournal of Automated Reasoning, 1994
- Complexity Results for Nonmonotonic LogicsJournal of Logic and Computation, 1992
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991
- Hard problems for simple default logicsArtificial Intelligence, 1991
- On the representation and querying of sets of possible worldsTheoretical Computer Science, 1991
- On the relation between default and autoepistemic logicArtificial Intelligence, 1988
- On generating all maximal independent setsInformation Processing Letters, 1988
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985