We define the class of e-bounded theories in the epistemic situation calculus, where the number of fluent atoms that the agent thinks may be true is bounded by a constant. Such theories can still have an infinite domain and an infinite set of states. We show that for them verification of an expres-sive class of first-order µ-calculus temporal epis-temic properties is decidable. We also show that if the agent’s knowledge in the initial situation is e-bounded and the objective part of an action theory maintains boundedness, then the entire epistemic theory is e-bounded
The paper analyses dynamic epistemic logic from a topological perspective. The main contribution con...
We present an axiomatisation for an extension of a temporal epistemic logic with an epistemic “reset...
Abstract: This paper presents an approach to the verification of temporal epistemic logic in synchr...
We define the class of e-bounded theories in the epistemic situation calculus, where the number of f...
We define a notion of bounded action theory in the situation calculus, where the theory entails that...
We define a notion of bounded action theory in the situation calculus, where the theory entails that...
In this talk, we survey recent results on situation calculus bounded action theories. These are acti...
In this paper we investigate agents that have incomplete informa-tion and make decisions based on th...
In this paper, we investigate bounded action theories in the situation calculus. A bounded action t...
The progression of action theories is an important problem in knowledge representation. Progression ...
Abstract We present a framework for verifying temporal and epistemic properties of multi-agent syste...
Abstract. An agent who bases his actions upon explicit logical formulae has at any given point time ...
We explore when finite epistemic models are definable up to simulation or bisimulation, either over ...
We present an axiomatisation for an extension of a temporal epistemic logic with an epistemic “reset...
We introduce an algebraic approach to Dynamic Epistemic Logic. This approach has the advantage that:...
The paper analyses dynamic epistemic logic from a topological perspective. The main contribution con...
We present an axiomatisation for an extension of a temporal epistemic logic with an epistemic “reset...
Abstract: This paper presents an approach to the verification of temporal epistemic logic in synchr...
We define the class of e-bounded theories in the epistemic situation calculus, where the number of f...
We define a notion of bounded action theory in the situation calculus, where the theory entails that...
We define a notion of bounded action theory in the situation calculus, where the theory entails that...
In this talk, we survey recent results on situation calculus bounded action theories. These are acti...
In this paper we investigate agents that have incomplete informa-tion and make decisions based on th...
In this paper, we investigate bounded action theories in the situation calculus. A bounded action t...
The progression of action theories is an important problem in knowledge representation. Progression ...
Abstract We present a framework for verifying temporal and epistemic properties of multi-agent syste...
Abstract. An agent who bases his actions upon explicit logical formulae has at any given point time ...
We explore when finite epistemic models are definable up to simulation or bisimulation, either over ...
We present an axiomatisation for an extension of a temporal epistemic logic with an epistemic “reset...
We introduce an algebraic approach to Dynamic Epistemic Logic. This approach has the advantage that:...
The paper analyses dynamic epistemic logic from a topological perspective. The main contribution con...
We present an axiomatisation for an extension of a temporal epistemic logic with an epistemic “reset...
Abstract: This paper presents an approach to the verification of temporal epistemic logic in synchr...