Ordered model trees: A normal form for disjunctive deductive databases
- 1 January 1994
- journal article
- research article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 13 (1) , 117-143
- https://doi.org/10.1007/bf00881914
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On indefinite databases and the closed world assumptionPublished by Springer Nature ,2005
- On representing indefinite and maybe information in relational databases: a generalizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Disjunctive LP+integrity constraints= stable model semanticsAnnals of Mathematics and Artificial Intelligence, 1993
- Indefinite and maybe information in relational databasesACM Transactions on Database Systems, 1990
- A sound and complete query evaluation algorithm for relational databases with disjunctive informationPublished by Association for Computing Machinery (ACM) ,1989
- Deduction in non-Horn databasesJournal of Automated Reasoning, 1985
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960