Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Nonmonotonic logic and temporal projection
Artificial Intelligence
Nonmonotonic reasoning in the framework of situation calculus
Artificial Intelligence - Special issue on knowledge representation
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Solving the frame problem: a mathematical investigation of the common sense law of inertia
Solving the frame problem: a mathematical investigation of the common sense law of inertia
Theories of abstract automata (Prentice-Hall series in automatic computation)
Theories of abstract automata (Prentice-Hall series in automatic computation)
System properties of action theories
AIS'04 Proceedings of the 13th international conference on AI, Simulation, and Planning in High Autonomy Systems
System properties of action theories
AIS'04 Proceedings of the 13th international conference on AI, Simulation, and Planning in High Autonomy Systems
| Hi-index | 0.01 |
A well-known circumscription policy in situation calculus theories of actions is to minimize the Abnormality predicate by varying the Holds predicate. Unfortunately this admitted counter-intuitive models. A different policy of varying the Result function eliminated these models. Explanations of how it did this are not entirely satisfactory, but seem to appeal to informal notions of state minimization. We reexamine this policy and show that there are simple justifications for it that are based on classical automata theory. It incidentally turns out that the description "state minimization" for the varying Result policy is more accurate than the original nomenclature had intended.