A possible world semantics for disjunctive databases
- 1 April 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 5 (2) , 282-292
- https://doi.org/10.1109/69.219736
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- On indefinite databases and the closed world assumptionPublished by Springer Nature ,2005
- Generalized Closed World Assumption is II02-CompleteInformation Processing Letters, 1990
- The alternating fixpoint of logic programs with negationPublished by Association for Computing Machinery (ACM) ,1989
- Compiling the GCWA in Indefinite Deductive DatabasesPublished by Elsevier ,1988
- On the Declarative Semantics of Deductive Databases and Logic ProgramsPublished by Elsevier ,1988
- On the Declarative Semantics of Logic Programs with NegationPublished by Elsevier ,1988
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- Deduction in non-Horn databasesJournal of Automated Reasoning, 1985
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972