State minimization re-visited

Norman Foo, Abhaya Nayak, Maurice Pagnucco, Dongmo Zhang

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

1 Citation (Scopus)


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.

Original languageEnglish
Title of host publicationAI 2001: Advances in Artificial Intelligence
Subtitle of host publication14th Australian Joint Conference on Artificial Intelligence Adelaide, Australia, December 10–14, 2001 Proceedings
EditorsMarkus Stumptner, Dan Corbett, Mike Brooks
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Number of pages12
ISBN (Electronic)9783540456568
ISBN (Print)9783540429609
Publication statusPublished - 2001
Event14th Australian Joint Conference on Artificial Intelligence, AI 2001 - Adelaide, Australia
Duration: 10 Dec 200114 Dec 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)03029743
ISSN (Electronic)16113349


Other14th Australian Joint Conference on Artificial Intelligence, AI 2001


Dive into the research topics of 'State minimization re-visited'. Together they form a unique fingerprint.

Cite this