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 expressive class of first-order μ-calculus temporal epistemic properties is decidable. We also show that ...

We propose a theory for reasoning about actions based on order-sorted predicate logic where one can consider an elaborate taxonomy of objects. We are interested in the projection problem: whether a statement is true after executing a sequence of actions. To solve it we design a regression operator that takes advantage of well-sorted unification between terms. We show that answering projection q...

Knowledge, Belief, and Noisy Sensing in the Situation Calculus Patricio D. Simari Master of Science Graduate Department of Computer Science University of Toronto 2004 The extension to the situation calculus presented by Bacchus et al. formalizes the concept of noisy actions and shows how an agent can update its beliefs, which are modeled probabilistically, when relying on noisy sensors and effe...

In this paper we make a detailed comparison of the Situation Calculus and the Event Calculus, two logic-based temporal reasoning formalisms. We concentrate on diierences between the calculi, considering the similarities suuciently indicated in the recent literature. We illustrate the inability of Event Calculus to handle counterfactual reasoning problems, and that of Situation Calculus to deal ...

A formal framework for specifying and developing agents/robots must handle not only knowledge and sensing actions, but also time and concurrency. Researchers have extended the situation calculus to handle knowledge and sensing actions. Other researchers have addressed the issue of adding time and concurrent actions. Here both of these features are combined into a unified logical theory of knowl...

Software architecture constitutes the primary design of a software system. Consequently, architectural design decisions involved in architecture design have a key impact on the system in such aspects as future maintenance costs, resulting quality, and timeliness. However, the applied knowledge employed and the design decisions taken by soihvare architects are not explicitly represented in the d...

•Describing actions and their effects in a dynamic system •A set of first-order axioms, mainly includes: Dap (precondition axioms): For each A(~x), Poss(A(~x), s) ≡ φA(~x, s) Dssa (successor state axioms): For each fluent F (~y, s), F (~y, do(a, s)) ≡ ∨ iψ + i (~y, a, s) ∨ F (~y, s) ∧ ¬( ∨ j ψ − j (~y, a, s)) DS0 (an initial theory): All facts hold in the initial situation S0 Duna (unique name ...

We propose an action formalism that is based on description logics (DLs) and may be viewed as an instance of the Situation Calculus (SitCalc). In particular, description logic concepts can be used for describing the state of the world, and the preand post-conditions of actions. The main advantage of such a combination is that, on the one hand, the expressive power for describing world states an...

A team of agents is jointly able to achieve a goal if despite any incomplete knowledge they may have about the world or each other, they still know enough to be able to get to a goal state. Unlike in the single-agent case, the mere existence of a working plan is not enough as there may be several incompatible working plans and the agents may not be able to choose a share that coordinates with t...

This paper presents an argumentation mechanism for reconciling conflicts between planning agents related to plan proposals, which are caused by inconsistencies between basic beliefs regarding the state of the world or the specification of the planning operators. We introduce simple and efficient argument moves that enable discussion about planning steps, and show how these can be integrated int...