Default logic as a query language
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 9 (3) , 448-463
- https://doi.org/10.1109/69.599933
Abstract
Research in nonmonotonic reasoning has focused largely on the idea of representing knowledge about the world via rules that are generally true but can be defeated. Even if relational databases are nowadays the main tool for storing very large sets of data, the approach of using nonmonotonic Al formalisms as relational database query languages has been investigated to a much smaller extent. In this work, we propose a novel application of Reiter's default logic by introducing a default query language (DQL) for finite relational databases, which is based on default rules. The main result of this paper is that DQL is as expressive as SO There Exists For All, the existential-universal fragment of second-order logic. This result is not only of theoretical importance: We exhibit queries-which are useful in practice--that can be expressed with DQL and cannot with other query languages based on nonmonotonic logics such as DATALOG with negation under the stable model semantics. In particular, we show that DQL is well-suited for diagnostic reasoningKeywords
This publication has 34 references indexed in Scilit:
- The Expressive Powers of Stable Models for Bound and Unbound DATALOG QueriesJournal of Computer and System Sciences, 1997
- The Expressive Powers of the Logic Programming SemanticsJournal of Computer and System Sciences, 1995
- A survey of complexity results for non-monotonic logicsThe Journal of Logic Programming, 1993
- Datalog with non-deterministic choice computes NDB-PTIMEPublished by Springer Nature ,1993
- Why not negation by fixpoint?Journal of Computer and System Sciences, 1991
- Autoepistemic logicJournal of the ACM, 1991
- General logical databases and programs: Default logic semantics and stratificationInformation and Computation, 1991
- Bounded Query ClassesSIAM Journal on Computing, 1990
- Stable models and non-determinism in logic programs with negationPublished by Association for Computing Machinery (ACM) ,1990
- Non-Deterministic Choice in DatalogPublished by Elsevier ,1988