While temporal verification of programs is a topic with a long history, its traditional basis--semantics based on word languages--is illsuited for modular reasoning about procedura...
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
Planning by analogical reasoning is a learning method that consists of the storage, retrieval, and replay of planning episodes. Planning performance improves with the accumulationa...
We present a two dimensional temporal structure that has an ever changing present. Relative to each present, there is a past and future. The main representational advantage our tw...