In this paper we propose a practical extension to some recent work on the progression of action theories in the situation calculus. In particular, we argue that the assumption of local-effect actions is too restrictive for realistic settings. Based on the notion of safe-range queries from database theory and just-in-time action histories, we present a new type of action theory, called range-restricted, that allows actions to have non-local effects with a restricted range. These theories can represent incomplete information in the initial database in terms of possible closures for fluents and can be progressed by directly updating the database in an algorithmic manner. We prove the correctness of our method and argue for the applicability of...
We define a notion of bounded action theory in the situation calculus, where the theory entails that...
In this thesis we study a reasoning module for agents that have cognitive abilities, such as memory,...
Among the most frequent reasoning tasks in the situation calculus are projection queries that query ...
In this paper we propose a practical extension to some recent work on the progression of action theo...
In this paper we propose a practical extension to some re-cent work on the progression of action the...
In this paper we study the progression of situation calculus action theories that arc able to handle...
In a seminal paper Lin and Reiter introduced the notion of progression for basic action theories in ...
In a seminal paper Lin and Reiter introduced the notion of progression for basic action theories in ...
In this paper, we propose a new progression mechanism for a restricted form of incomplete knowledge ...
Abstract In a seminal paper, Lin and Reiter introduced the notion of progression for basic action th...
In many tasks related to reasoning about consequences of a logical theory, it is desirable to decomp...
In a recent paper [2], Baumann et al. provided a comprehensive framework for default reasoning in ac...
In a seminal paper, Lin and Reiter introduced the notion of progression of basic action theories. Un...
We propose a simple relaxation of Reiter's basic action theories, based on fluents without succ...
We describe a system for specifying the effects of actions. Unlike those commonly used in AI plannin...
We define a notion of bounded action theory in the situation calculus, where the theory entails that...
In this thesis we study a reasoning module for agents that have cognitive abilities, such as memory,...
Among the most frequent reasoning tasks in the situation calculus are projection queries that query ...
In this paper we propose a practical extension to some recent work on the progression of action theo...
In this paper we propose a practical extension to some re-cent work on the progression of action the...
In this paper we study the progression of situation calculus action theories that arc able to handle...
In a seminal paper Lin and Reiter introduced the notion of progression for basic action theories in ...
In a seminal paper Lin and Reiter introduced the notion of progression for basic action theories in ...
In this paper, we propose a new progression mechanism for a restricted form of incomplete knowledge ...
Abstract In a seminal paper, Lin and Reiter introduced the notion of progression for basic action th...
In many tasks related to reasoning about consequences of a logical theory, it is desirable to decomp...
In a recent paper [2], Baumann et al. provided a comprehensive framework for default reasoning in ac...
In a seminal paper, Lin and Reiter introduced the notion of progression of basic action theories. Un...
We propose a simple relaxation of Reiter's basic action theories, based on fluents without succ...
We describe a system for specifying the effects of actions. Unlike those commonly used in AI plannin...
We define a notion of bounded action theory in the situation calculus, where the theory entails that...
In this thesis we study a reasoning module for agents that have cognitive abilities, such as memory,...
Among the most frequent reasoning tasks in the situation calculus are projection queries that query ...