Inductive properties of states

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

Abstract

In the situation calculus states are often distinguished from situations by the assumption that situations are paths in a rooted tree while a state is a particular truth assignment to the fluents. It is then possible that two situations have end points that agree on all fluents, i.e., are the same state, and yet be distinct from the perspective of situations. This has the merit of making inductive proofs simple as it introduces two axioms amounting to enforcing the rooted tree structure that are used as trivial bases for the inductions. In this paper we show that the tree structure is dispensable for induction when the underlying system is deterministic, thus elevating the state perspective to equal status.

Original languageEnglish
Title of host publicationAdvanced Topics in Artificial Intelligence - 10th Australian Joint Conference on Artificial Intelligence, AI 1997, Proceedings
EditorsAbdul Sattar
PublisherSpringer Verlag
Pages227-235
Number of pages9
ISBN (Print)3540637974, 9783540637974
DOIs
Publication statusPublished - 1997
Event10th Australian Joint Conference on Artificial Intelligence, AI 1997 - Perth, Australia
Duration: 30 Nov 19974 Dec 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1342
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th Australian Joint Conference on Artificial Intelligence, AI 1997
Country/TerritoryAustralia
CityPerth
Period30/11/974/12/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Fingerprint

Dive into the research topics of 'Inductive properties of states'. Together they form a unique fingerprint.

Cite this