Search Results

Progression in the Situation Calculus is perhaps one of the most extensively studied cases of updating logical theories over a sequence of actions. While it generally requires second-order logic, several useful first-order and tractable cases have been ...

The expanding use of information systems in industrial and commercial settings has increased the need for interoperation between software systems. In particular, many social, industrial, and business information systems require a common basis for a ...

Distributed agents concurrently learning to coordinate in a multiagent system can suffer from considerable amounts of agent noise. This is the noise that arises from the non-stationarity of the learning environment for each individual agent since other ...

We develop a situation calculus-based account of multi-player synchronous games. These are represented as action theories called situation calculus synchronous game structures (SCSGSs) that involve a single action tick whose effects depend on the ...

We argue that the mathematics developed for the semantics of computer languages can be fruitfully applied to problems in human communication and action.

We investigate the dynamics of nested beliefs in the context of agent interactions. Nested beliefs represent what agents believe about the beliefs of other agents. We consider the tell KQML performative which allows agents to send their own beliefs to ...

One of the principal concerns in the research area of Reasoning about Action is determining the ramifications of actions in changing environments. A particular tendency emerging in recent literature endorses the explicit incorporation of causal ...

Representing defeasibility is an important issue in common sense reasoning. In reasoning about action and change, this issue becomes more difficult because domain and action related defeasible information may conflict with general inertia rules. ...

Abstract: In recent years, research on planning algorithms has made big progress. Recent approaches encode the plan search space into a data structure called the planning graph. To extract plans, a planning graph is transformed into the satisfiability ...

Recent work on reasoning about action has shown that there exists an interesting connection between action specifications and state constraints — it is possible to extract state constraints from action specifications. This work provides us another way ...

In this paper a formal framework is proposed in which various informative actions are combined, corresponding to the different ways in which rational agents can acquire information. In order to solve the various conflicts that could possibly occur when ...