Closed-world databases and circumscription
From MaRDI portal
Publication:1079022
DOI10.1016/0004-3702(85)90055-4zbMath0596.68062OpenAlexW2000141049WikidataQ29035663 ScholiaQ29035663MaRDI QIDQ1079022
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)90055-4
Abstract data types; algebraic specification (68Q65) Artificial intelligence (68T99) Information storage and retrieval of data (68P20)
Related Items
The complexity of propositional closed world reasoning and circumscription, Formalizing incomplete knowledge in incomplete databases, Circumscriptive semantics for updating knowledge bases, Efficient reasoning about rich temporal domains, On the relationship between circumscription and negation as failure, An algorithm to compute circumscription, Minimalism, justification and non-monotonicity in deductive databases, ECWA made easy, Is intractability of nonmonotonic reasoning a real drawback?, Embedding circumscriptive theories in general disjunctive programs, Sound and efficient closed-world reasoning for planning, Closed world assumptions having precedence in predicates, 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, Preferred First-Order Answer Set Programs, Embedding prioritized circumscription in disjunctive logic programs, Negation in rule-based database languages: A survey, The semantics of incomplete databases as an expression of preferences, The open logic and its relation to circumscription, Expressing preferences in default logic, The complexity of predicate default logic over a countable domain, Logic programming and knowledge representation---The A-Prolog perspective
Cites Work
