A Semantics for Persistency in Propositional Dynamic Logic

Authors:
Jan Broersen;Roel Wieringa;John-Jules Ch. Meyer
Affiliations:
-;-;-
Venue:
CL '00 Proceedings of the First International Conference on Computational Logic
Year:
2000

Citing 15
Cited 1

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
Non-monotonic temporal reasoning

Handbook of logic in artificial intelligence and logic programming (Vol. 4)
Descriptive dynamic logic and its application to reflective architectures

Future Generation Computer Systems - Special double issue: reflection and meta-level AI architectures
From situation calculus to fluent calculus: state update axioms as a solution to the inferential frame problem

Artificial Intelligence
A logical approach to the dynamics of commitments

Artificial Intelligence
Propositional belief base update and minimal change

Artificial Intelligence
Dynamic logic for reasoning about actions and agents

Logic-based artificial intelligence
On the Frame Problem in Procedure Specifications

IEEE Transactions on Software Engineering
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
Causation and Nonmonotonic Temporal Reasoning

KI '97 Proceedings of the 21st Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
PDL-based framework for reasoning about actions

AI*IA '95 Proceedings of the 4th Congress of the Italian Association for Artificial Intelligence on Topics in Artificial Intelligence
Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version)

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A new logical framework for deductive planning

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Reasoning about actions: non-deterministic effects, constraints, and qualification

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Qualified ramifications

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

t-DeLP: an argumentation-based Temporal Defeasible Logic Programming framework

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper defines a minimal change semantics for PDL, that is based on minimization over a change ordering of labeled Kripke models. The definition of the change ordering has some striking resemblances with the notion of bisimulation. The minimal change semantics for PDL is shown to behave correctly in case of the notorious Yale shooting and stolen car example scenarios.