\(\mathcal M\)odular-\(\mathcal E\) and the role of elaboration tolerance in solving the qualification problem

DOI10.1016/j.artint.2010.04.008zbMath1216.68268WikidataQ62615102 ScholiaQ62615102MaRDI QIDQ543579

Rob Miller, Loizos Michael, Antonis C. Kakas

Publication date: 17 June 2011

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.04.008

zbMATH Keywords

reasoning about actions; default reasoning; elaboration tolerance; qualification problem

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

Related Items

Probabilistic reasoning about epistemic action narratives, A general first-order solution to the ramification problem with cycles

Uses Software

• CCalc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonmonotonic causal theories
• Reasoning about action. II: The qualification problem
• Nonmonotonic logic and temporal projection
• Circumscription - a form of non-monotonic reasoning
• Preferred answer sets for extended logic programs
• The qualification problem: A solution to the problem of anomalous models
• A simple declarative language for describing narratives with actions
• An abductive event calculus planner
• Event Calculus Planning Through Satisfiability
• CHICA, An Abductive Planning System Based on Event Calculus
• Logic Programming and Nonmonotonic Reasoning