The Situation and State Calculus versus Branching Temporal Logic

Authors:
Jaime Ramos;Amílcar Sernadas
Affiliations:
-;-
Venue:
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Year:
1998

Citing 9
Cited 0

Structuring theories on consequence

Lecture notes in Computer Science on Recent trends in data type specification
Miracles in formal theories of action

Artificial Intelligence
Completing the temporal picture

Selected papers of the 16th international colloquium on Automata, languages, and programming
The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression

Artificial intelligence and mathematical theory of computation
Modal and temporal logics

Handbook of logic in computer science (vol. 2)
Proving properties of states in the situation calculus

Artificial Intelligence
A temporal logic approach to object certification

Data & Knowledge Engineering
Fundamentals of Algebraic Specification I

Fundamentals of Algebraic Specification I
Introducing Institutions

Proceedings of the Carnegie Mellon Workshop on Logic of Programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

The situation calculus (SC) is a formalism for reasoning about action. Within SC, the notion of state of a given situation is usually characterized by the set of fluents that hold in that situation. However, this concept is insuficient for system specification. To overcome this limitation, an extension of SC is proposed, the situation and state calculus (SSC), where the concept of state is primitive, just like actions, situations and fluents. SSC is then compared with a branching temporal logic (BTL). A representation of BTL in SSC is defined and shown to establish a sound and complete encoding.