The semantics of incomplete databases as an expression of preferences
- 21 January 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 78 (1) , 113-136
- https://doi.org/10.1016/0304-3975(51)90005-9
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Procedural interpretation of non-horn logic programsPublished by Springer Nature ,2005
- On indefinite databases and the closed world assumptionPublished by Springer Nature ,2005
- An efficient strategy for non-Horn deductive databasesTheoretical Computer Science, 1991
- On the relationship between circumscription and negation as failureArtificial Intelligence, 1989
- An algorithm to compute circumscriptionArtificial Intelligence, 1989
- Closed-world databases and circumscriptionArtificial Intelligence, 1985
- Saturation, nonmonotonic reasoning and the closed-world assumptionArtificial Intelligence, 1985
- Denotational semantics: The scott-strachey approach to programming language theory: Joseph E. Stoy (The MIT Press, Cambridge, MA)Computer Languages, 1983
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976