Saturation, nonmonotonic reasoning and the closed-world assumption
From MaRDI portal
Publication:1060864
DOI10.1016/0004-3702(85)90040-2zbMath0569.68078OpenAlexW2039303449MaRDI QIDQ1060864
Pierre Siegel, Genevieve Bossu
Publication date: 1985
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(85)90040-2
monotonicitypositive sentencesnegative conclusionsgroundable clausesimplicit negative informationpredicate circumscriptionproof-theoretic approach to data bases
Abstract data types; algebraic specification (68Q65) Artificial intelligence (68T99) Classical first-order logic (03B10) Information storage and retrieval of data (68P20) Properties of classes of models (03C52)
Related Items
An algorithm for determining database consistency under the closed world assumption ⋮ Tableau-based characterization and theorem proving for default logic ⋮ Preferences in artificial intelligence ⋮ Negation as failure: careful closure procedure ⋮ Modal logic based theory for non-monotonic reasoning ⋮ A natural semantics for modal logic over databases ⋮ Redundancy in logic. III: Non-monotonic reasoning ⋮ 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 ⋮ Answering atomic queries in indefinite deductive databases ⋮ ECWA made easy ⋮ Negation as failure for disjunctive logic programming ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ Embedding circumscriptive theories in general disjunctive programs ⋮ Inductive equivalence in clausal logic and nonmonotonic logic programming ⋮ Brave induction: a logical framework for learning from incomplete information ⋮ Closed world assumptions having precedence in predicates ⋮ General logical databases and programs: Default logic semantics and stratification ⋮ Preferential semantics using non-smooth preference relations ⋮ Partition-based logical reasoning for first-order and propositional theories ⋮ An efficient method for eliminating varying predicates from a circumscription ⋮ Resolving ambiguity in nonmonotonic inheritance hierarchies ⋮ Linear resolution for consequence finding ⋮ On the complexity of propositional knowledge base revision, updates, and counterfactuals ⋮ CUMULATIVITY WITHOUT CLOSURE OF THE DOMAIN UNDER FINITE UNIONS ⋮ A theory of hierarchical consequence and conditionals ⋮ A theorem on the consistency of circumscription ⋮ Negation in rule-based database languages: A survey ⋮ The semantics of incomplete databases as an expression of preferences ⋮ Negation by default and unstratifiable logic programs ⋮ REACTIVE PREFERENTIAL STRUCTURES AND NONMONOTONIC CONSEQUENCE ⋮ Note about cardinality-based circumscription ⋮ Prioritized logic programming and its application to commonsense reasoning ⋮ First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment ⋮ New techniques and completeness results for preferential structures ⋮ Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases ⋮ On the satisfiability of circumscription
Cites Work
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- The mathematics of non-monotonic reasoning
- Equality and Domain Closure in First-Order Databases
- Automatic Theorem Proving With Renamable and Semantic Resolution
- Two Results on Ordering for Resolution with Merging and Linear Format
- Unnamed Item
- Unnamed Item
- Unnamed Item
