@inproceedings{377dbf71e04349f8a93fdd1c2bdb4136,
title = "State minimization re-visited",
abstract = "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 re-examine 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.",
author = "Norman Foo and Abhaya Nayak and Maurice Pagnucco and Dongmo Zhang",
year = "2001",
doi = "10.1007/3-540-45656-2_14",
language = "English",
isbn = "9783540429609",
volume = "2256",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "153--164",
editor = "Markus Stumptner and Dan Corbett and Mike Brooks",
booktitle = "AI 2001: Advances in Artificial Intelligence",
address = "United States",
note = "14th Australian Joint Conference on Artificial Intelligence, AI 2001 ; Conference date: 10-12-2001 Through 14-12-2001",
}