Formalizing incomplete knowledge in incomplete databases
From MaRDI portal
Publication:1337644
DOI10.1007/BF02943545zbMath0821.68049MaRDI QIDQ1337644
Publication date: 8 November 1994
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Cites Work
- Closed-world databases and circumscription
- On the relationship between circumscription and negation as failure
- An algorithm to compute circumscription
- Circumscription - a form of non-monotonic reasoning
- An algorithm for determining database consistency under the closed world assumption
- Answering atomic queries in indefinite deductive databases
- Contributions to the Theory of Logic Programming
- The Semantics of Predicate Logic as a Programming Language
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Formalizing incomplete knowledge in incomplete databases