Closed-world databases and circumscription
From MaRDI portal
There is a similarity between the closed-world assumption and circumscribing predicate symbols in the sense of predicate minimization. The purpose of the paper is to investigate under what conditions the closed-world assumption and the result of circumscribing all predicates are equivalent. Closed-world assumption is shown to be equivalent to a special case of circumscription. Reasons are given why circumscription is a substantially more powerful form of non-monotonic reasoning.
Recommendations
- scientific article; zbMATH DE number 589696
- On compact representations of propositional circumscription
- Saturation, nonmonotonic reasoning and the closed-world assumption
- The complexity of propositional closed world reasoning and circumscription
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
Cites work
- Circumscription - a form of non-monotonic reasoning
- Circumscription and implicit definability
- Equality and Domain Closure in First-Order Databases
- scientific article; zbMATH DE number 3359806 (Why is no real title available?)
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
Cited in
(33)- Efficient reasoning about rich temporal domains
- On the relationship between circumscription and negation as failure
- An algorithm to compute circumscription
- The importance of open and recursive circumscription
- Minimalism, justification and non-monotonicity in deductive databases
- Between constructive mathematics and PROLOG
- An efficient method for eliminating varying predicates from a circumscription
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- The open logic and its relation to circumscription
- The complexity of propositional closed world reasoning and circumscription
- Formalizing incomplete knowledge in incomplete databases
- Circumscriptive semantics for updating knowledge bases
- Is intractability of nonmonotonic reasoning a real drawback?
- Sound and efficient closed-world reasoning for planning
- Expressing preferences in default logic
- Logic programming and knowledge representation---The A-Prolog perspective
- The complexity of predicate default logic over a countable domain
- ECWA made easy
- scientific article; zbMATH DE number 1670573 (Why is no real title available?)
- scientific article; zbMATH DE number 67497 (Why is no real title available?)
- scientific article; zbMATH DE number 589696 (Why is no real title available?)
- Embedding prioritized circumscription in disjunctive logic programs
- Applying the closed world assumption to SUMO-based FOL ontologies for effective commonsense reasoning
- Embedding circumscriptive theories in general disjunctive programs
- Preferred first-order answer set programs
- Logic Programming and Nonmonotonic Reasoning
- scientific article; zbMATH DE number 4185021 (Why is no real title available?)
- Closed world assumption for disjunctive reasoning
- Negation in rule-based database languages: A survey
- The semantics of incomplete databases as an expression of preferences
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
- Closed world assumptions having precedence in predicates
This page was built for publication: Closed-world databases and circumscription
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079022)
