Recently, Lakemeyer and Levesque proposed a logic of onlyknowing which precisely captures three forms of nonmonotonic reasoning: Moore's Autoepistemic Logic, Konolige's ...
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
We present a novel approach to plan recognition in which graph construction and analysis is used as a paradigm. We use a graph structure called a Goal Graph for the plan recogniti...
The representation of narratives of actions and observations is a current issue in Knowledge Representation, where traditional plan-oriented treatments of action seem to fall shor...
In [Dague, 1993], a formal system ROM(K) involving four relations has been defined to reason with relative orders of magnitude. In this paper, problems of introducing quantitative...