Formalizing incomplete knowledge in incomplete databases
From MaRDI portal
Recommendations
Cites work
- An algorithm for determining database consistency under the closed world assumption
- An algorithm to compute circumscription
- Answering atomic queries in indefinite deductive databases
- Circumscription - a form of non-monotonic reasoning
- Closed-world databases and circumscription
- Contributions to the Theory of Logic Programming
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 3755910 (Why is no real title available?)
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- On the relationship between circumscription and negation as failure
- The Semantics of Predicate Logic as a Programming Language
Cited in
(10)- Extensive form implementation in incomplete information environments
- Logic programming and reasoning with incomplete information
- scientific article; zbMATH DE number 4160165 (Why is no real title available?)
- scientific article; zbMATH DE number 4053078 (Why is no real title available?)
- An Approach to Handling Incomplete Information in Databases
- Addition and removal of information for a knowledge base with incomplete information
- scientific article; zbMATH DE number 1790348 (Why is no real title available?)
- Negative knowledge for certain query answers
- Representation of Partial Knowledge and Query Answering in Locally Complete Databases
- The semantics of incomplete databases as an expression of preferences
This page was built for publication: Formalizing incomplete knowledge in incomplete databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337644)
