Eliminating the fixed predicates from a circumscription

DOI10.1016/0004-3702(89)90018-0zbMath0672.03013OpenAlexW2037688519MaRDI QIDQ1119564

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)

Related Items (10)

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

Cites Work

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

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