# Semantics for a useful fragment of the situation calculus

@inproceedings{Lakemeyer2005SemanticsFA, title={Semantics for a useful fragment of the situation calculus}, author={Gerhard Lakemeyer and Hector J. Levesque}, booktitle={IJCAI}, year={2005} }

In a recent paper, we presented a new logic called ES for reasoning about the knowledge, action, and perception of an agent. Although formulated using modal operators, we argued that the language was in fact a dialect of the situation calculus but with the situation terms suppressed. This allowed us to develop a clean and workable semantics for the language without piggybacking on the generic Tarski semantics for first-order logic. In this paper, we reconsider the relation between ES and the… Expand

#### Figures and Topics from this paper

#### 34 Citations

The Situation Calculus: A Case for Modal Logic

- Mathematics, Computer Science
- J. Log. Lang. Inf.
- 2010

This paper presents a modal version of the situation calculus where problems of knowledge and time have been addressed and can be overcome with relative ease and without sacrificing the advantages of the original. Expand

A Semantics for ADL as Progression in the Situation Calculus

- Computer Science
- 2006

A notion of progression is developed, which is similar to that of Lin and Reiter but also simpler given the semantics underlying ES, and it is established that updating an ADL database after performing an action is correct in the sense that the resulting state corresponds precisely to progressing the corresponding basic action theory. Expand

A semantic characterization of a useful fragment of the situation calculus with knowledge

- Mathematics, Computer Science
- Artif. Intell.
- 2011

The situation calculus, as proposed by McCarthy and Hayes, and developed over the last decade by Reiter and co-workers, is reconsidered. A new logical variant called ES is proposed that captures much… Expand

A Situation-Calculus Semantics for an Expressive Fragment of PDDL

- Computer Science
- AAAI
- 2007

An alternative semantics for an expressive fragment of PDDL within the situation calculus is proposed, which is purely declarative, making it amenable to an analysis in terms of logical entailments and facilitates the comparison with and mapping to other formalisms that are defined on top of the same logic, such as the agent control language Golog. Expand

From Situation Calculus to Dynamic Epistemic Logic

- Mathematics, Computer Science
- J. Log. Comput.
- 2011

This work recasts restricted basic action theories in a propositional modal logic, viz. dynamic epistemic logic with public announcements and public assignments, by recasting Reiter's solution to the frame problem in terms of successor state axioms and Scherl and Levesque's extension to knowledge. Expand

A Well-typed Lightweight Situation Calculus

- Computer Science
- ArXiv
- 2012

This paper proposes to add more typing mechanisms to the current version of situation calculus, especially for three basic elements in situation calculus: situations, actions and objects, and then performs rigid type checking for existing situation calculus programs to find out the well-typing and ill-typed ones. Expand

Foundations for Knowledge-Based Programs using ES

- Computer Science
- KR
- 2006

This paper shows that, by moving to a new situation calculus recently proposed by Lakemeyer and Levesque, one cannot only reconstruct Reiter's foundations for knowledge-based programs but can significantly go beyond them, which includes removing the above restrictions and more. Expand

Progression and verification of situation calculus agents with bounded beliefs

- Computer Science
- AAMAS 2014
- 2014

This paper shows that for bounded action theories, progression, and hence belief states, can always be represented in first-order logic, and proves decidability of temporal verification over online executions, i.e., those executions resulting from agents performing only actions that are feasible according to their beliefs. Expand

Incorporating Action Models into the Situation Calculus

- Mathematics, Computer Science
- Johan van Benthem on Logic and Information Dynamics
- 2014

This paper incorporates the idea of action models from DELs into the situation calculus to develop a general multi-agent extension of it, analyzes properties of beliefs in this extension, and proves that action model logic can be embedded into the extended situation calculus. Expand

Alternating-Time Temporal Announcement Logic

- Mathematics, Computer Science
- CLIMA
- 2011

A sound and complete axiomatization for ATAL is provided and comparisons with several other logics, such as Public Announcement Logic with Assignment, Arbitrary Public Announcements Logic, Coalition Logic and Alternating-time Temporal Logic are drawn. Expand

#### References

SHOWING 1-10 OF 37 REFERENCES

Formalizing Action and Change in Modal Logic I: the frame problem

- Computer Science, Mathematics
- J. Log. Comput.
- 1999

This paper presents the basic framework of a logic of actions and plans in terms of modal logic combined with a notion of dependence, and gives the semantics and associate an axiomatics and a decision procedure to it. Expand

Situation Calculus as Hybrid Logic: First Steps

- Computer Science
- EPIA
- 2001

It is shown that quantified hybrid logic, QHL, is able to express situation calculus formulas often more natural and concise than the original formulations, and tailor-made for expressing the fluents of situation calculus. Expand

Situations, Si! Situation Terms, No!

- Computer Science
- KR
- 2004

The situation calculus, as proposed by McCarthy and Hayes, and developed over the last decade by Reiter and co-workers, is reconsidered. A new logical variant is proposed that captures much of the… Expand

GOLOG: A Logic Programming Language for Dynamic Domains

- Computer Science
- J. Log. Program.
- 1997

A new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world is proposed. Expand

SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC

- Computer Science
- FOCS 1976
- 1976

An appropriate axiom system is given which is complete for loop-free programs and also puts conventional predicate calculus in a different light by lumping quantifiers with non-logical assignments rather than treating them as logical concepts. Expand

Semantical consideration on floyo-hoare logic

- Computer Science
- 17th Annual Symposium on Foundations of Computer Science (sfcs 1976)
- 1976

An appropriate axiom system is given which is complete for loop-free programs and also puts conventional predicate calculus in a different light by lumping quantifiers with non-logical assignments rather than treating them as logical concepts. Expand

SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE

- Computer Science
- 1981

The formalism of this paper represents an advance over McCarthy (1963) and Green (1969) in that it permits proof of the correctness of strategies that contain loops and strategies that involve the acquisition of knowledge; and it is also somewhat more concise. Expand

A New Introduction to Modal Logic

- Computer Science, Philosophy
- 1968

This long-awaited book replaces Hughes and Cresswell's two classic studies of modal logic with all the new developments that have taken place since 1968 in both modal propositional logic and modal predicate logic, without sacrificing clarity of exposition and approachability. Expand

Knowledge, action, and the frame problem

- Mathematics, Computer Science
- Artif. Intell.
- 2003

The work is an extension of Reiter's approach to the frame problem for ordinary actions and Moore's work on knowledge and action and shows that a form of regression examined by Reiter for reducing reasoning about future situations to reasoning about the initial situation now also applies to knowledge-producing actions. Expand

The logic of knowledge bases

- Computer Science
- 2000

This book offers a new mathematical model of knowledge that is general and expressive yet more workable in practice than previous models, and presents a style of semantic argument and formal analysis that would be cumbersome or completely impractical with other approaches. Expand