Eliminating the fixed predicates from a circumscription

DOI10.1016/0004-3702(89)90018-0MaRDI QIDQ1119564zbMATH OpenOpenAlexFDO

Authors Johan de Kleer, Kurt Konolige

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)90018-0

zbMATH Keywords

nonmonotonic reasoningfixed predicatesparallel predicate circumscriptionprioritized circumscription

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Artificial intelligence (68T99)

Recommendations

• An efficient method for eliminating varying predicates from a circumscription
• scientific article; zbMATH DE number 640290
• scientific article; zbMATH DE number 4164169
• scientific article; zbMATH DE number 67498
• The expressive power of circumscription

Cites work

• Circumscription - a form of non-monotonic reasoning
• Model theory
• Semantical considerations on nonmonotonic logic
• The mathematics of non-monotonic reasoning

Cited in

(13)

• Compiling a default reasoning system into Prolog
• Reducing belief revision to circumscription (and vice versa)
• Note about cardinality-based circumscription
• Embedding circumscriptive theories in general disjunctive programs
• The expressive power of circumscription
• A consistency-based approach for belief change
• Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
• Eliminating disjunctions of leads-to properties
• An efficient method for eliminating varying predicates from a circumscription
• The complexity of propositional closed world reasoning and circumscription
• Redundancy in logic. III: Non-monotonic reasoning
• Conservative query normalization on parallel circumscription
• The Monotonous Elimination of Predicate Variables

This page was built for publication: Eliminating the fixed predicates from a circumscription

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119564)