Abstract
Finite-state methods are applied to determine the consequences of events, represented as strings of sets of fluents. Developed to flesh out events used in natural language semantics, the approach supports reasoning about action in AI, including the frame problem and inertia. Representational and inferential aspects of the approach are explored, centering on conciseness of language, context update and constraint application with bias. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Fernando, T. (2006). Finite-state temporal projection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4094 LNCS, pp. 230–241). Springer Verlag. https://doi.org/10.1007/11812128_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
