IDA Dept. of Computer and Information science, Linköping University

IDA Technical Reports: abstract

Generated: Mon, 24 Nov 2014 07:45:18

Sandewall, E. (1988). Formal Semantics for Reasoning about Change with Ramified Causal Minimization. Technical Report LiTH-IDA-R-88-08, Department of Computer and Information Science, Linköping University, Sweden. (bibtex),

Abstract: We deal with the frame problems, including the qualification problem, by requiring that for every state change there is a corresponding action causing it, and minimize the set of actions. An action may cause other actions occurring at the same time, or afterwards. The syntax and semantics are specified for a logic where this approach to the frame problem can be expressed stringently, and the proper minimization criterium is formulated.One characteristic feature of this work is that sub-structures which are used in the semantics, such as partial states and descriptors, are also "first class citizens" from the syntactic point of view. In this way we obtain a kind of reification, but with less formal overhead than when formulas are reified directly.

Goto (at Linköping University): CS Dept TR Overview