Revision programs were introduced by Marek and Truszczynski to specify change in knowledge bases. In this paper we show how to embed revision programs in logic programs with situation calculus notation. We extend Marek and Truszczynski's approach to allow incomplete initial knowledge base and extend the rules of revision programs to depend both on the initial and the nal knowledge base. We show...

Most agents can acquire information about their environments as they operate. A good plan for such an agent is one that not only achieves the goal, but is also executable, i.e., ensures that the agent has enough information at every step to know what to do next. In this paper, we present a formal account of what it means for an agent to know how to execute a plan and to be able to achieve a goa...

The situation calculus is a popular formalism for reasoning about actions and change. Since the language is first-order, reasoning in the situation calculus is undecidable in general. An important question then is how to weaken reasoning in a principled way to guarantee decidability. Existing approaches either drastically limit the representation of the action theory or neglect important aspect...

This paper presents a system that controls the behavior of a mobile robot. The system is based on situation calculus, the initial state is described and a goal is given, Prolog produces an answer to this goal and we use an interface in Visual Basic to interpret the answer given by it. After of interpreting the given actions in response we send commands to the mobile robot through a serial port ...

In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they rely on the assumption that fluents persist, and because actions have effects on the next situation only. In this paper we provide a solution to the ramification problem based on an extension of the situation calculus ...

Recent attacks are better coordinated, difficult to discover, and inflict severe damages to networks. However, existing response systems handle the case of a single ongoing attack. This limitation is due to the lack of an appropriate model that describes coordinated attacks. In this paper, we address this limitation by presenting a new formal description of individual, coordinated, and concurre...

Web service composition needs to increase the dynamic feature of adapting complex and unstable business environment. Thus the service selection and evaluation are very important for service composition. Although previous studies have stated some approaches to support dynamic composition, they are unable to balance the flexibility and verification very well in dynamic environment. Moreover, most...

We present a formalization of the blocks world on the basis of the situation calculus and circumscription, and investigate its mathematical properties. The main theorem describes the eeect of the circumscription which solves the frame problem in the presence of ramiications. The theorem is quite general, in the sense that it is applicable not only to the blocks world, but to a whole class of do...

In this paper, to compare the situation calculus and event calculus we formulate both as logic programs and prove properties of these by reasoning with their completions augmented with induction. We thus show that the situation calculus and event calculus imply one another. Whereas our derivation of the event calculus from the situation calculus requires the use of induction, our derivation of ...

The problem of formalising continuous change within reasoning about action systems such as the situation calculus has recently been receiving increasing attention ((Rei96], MS96]). In this paper we show that a long-existing systems theoretic reasoning methodology, that of Zeigler's DEVS (discrete event system speciication), not only subsumes the standard situation calculus but is able to elegan...