An algorithm to compute circumscription
From MaRDI portal
Publication:1115208
DOI10.1016/0004-3702(89)90067-2zbMath0663.68098OpenAlexW2004352874MaRDI QIDQ1115208
Publication date: 1989
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(89)90067-2
incomplete informationnonmonotonic reasoningcircumscriptionclosed-world assumptionnegative informationknowledge representation systems
Related Items
The complexity of propositional closed world reasoning and circumscription, A three-valued semantics for deductive databases and logic programs, Formalizing incomplete knowledge in incomplete databases, Reconsideration of circumscriptive induction with pointwise circumscription, Generating all maximal models of a Boolean expression, A tableau prover for domain minimization, Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction, Tableau-based characterization and theorem proving for default logic, On the relationship between circumscription and negation as failure, Efficient query processing with reduced implicate tries, Circumscribing DATALOG: expressive power and complexity, ECWA made easy, Modular specifications with supernormal defaults, On compact representations of propositional circumscription, An extension of pointwise circumscription, Embedding circumscriptive theories in general disjunctive programs, Reducing belief revision to circumscription (and vice versa), Projection and scope-determined circumscription, First order LUB approximations: characterization and algorithms, A tableau calculus for minimal model reasoning, An efficient method for eliminating varying predicates from a circumscription, Linear resolution for consequence finding, On the complexity of propositional knowledge base revision, updates, and counterfactuals, A Prolog technology theorem prover: A new exposition and implementation in Prolog, Embedding prioritized circumscription in disjunctive logic programs, Conservative query normalization on parallel circumscription, Embedding Logics in the Local Computation Framework, Compiling a default reasoning system into Prolog, The semantics of incomplete databases as an expression of preferences, Prolog technology for default reasoning: proof theory and compilation techniques, An abductive framework for negation in disjunctive logic programming, Preprocessing of intractable problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Saturation, nonmonotonic reasoning and the closed-world assumption
- Semantical considerations on nonmonotonic logic
- Closed-world databases and circumscription
- Negation as failure: careful closure procedure
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Non-monotonic logic. I
- Deduction in non-Horn databases
