Abstract:
. Propositional Dynamic Logics (PDL's) provide a suitable formal framework for modeling actions and reasoning about them. However, the basic language of PDL's lack several features that are important for a sophisticated treatment of actions. In this paper, we present a new logic that is obtained by enriching the basic PDL with powerful modeling constructs that allow us to represent determinism and nondeterminisms, concurrency, hierarchies, mutual exclusion, backward execution, and non-execution of actions. We demonstrate, by means of examples, the expressive power of the formalism. In particular, we show that although nonmonotonicity is not generally captured by PDL's, our logic is perfectly suited for exploiting monotonic solutions to the frame problem. Finally, we establish that the proposed formalism is decidable, and that the basic reasoning problems are EXPTIME-complete. 1 Introduction Propositional Dynamic Logics (PDL's) are modal logics for describing and reasoning about system...
Citations
|
2701
|
Communication and Concurrency
– Milner
- 1989
|
|
641
|
Dynamic Logic
– Harel
- 1984
|
|
495
|
The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression
– Reiter
- 1991
|
|
288
|
A guide to completeness and complexity for modal logics of knowledge and belief
– Halpern, Moses
- 1992
|
|
212
|
A correspondence theory for terminological logics
– Schild
- 1991
|
|
211
|
State constraints revisited
– Lin, Reiter
- 1994
|
|
195
|
Results on the propositional mu-calculus
– Kozen
- 1983
|
|
179
|
Modal and Temporal Logics
– Stirling
- 1991
|
|
140
|
Monotonic solution of the frame problem in the situation calculus: an e cient method for worlds with fully speci ed actions
– Schubert
- 1990
|
|
120
|
Logics of program
– Kozen, Tiurzyn
- 1990
|
|
102
|
Proving properties of states in the situation calculus
– Reiter
|
|
76
|
Boosting the correspondence between descriptionlogics and propositional dynamic logics
– Giacomo, Lenzerini
|
|
68
|
The case for domain-specific frame axioms
– Haas
- 1987
|
|
66
|
Theorem proving by resolution as a basis for questionanswering systems
– Green
- 1969
|
|
57
|
Decidability of Class-Based Knowledge Representation Formalisms
– Giacomo
- 1995
|
|
40
|
A modal perspective on computational complexity of attribute value grammars
– Blackburn, Spaan
- 1993
|
|
30
|
Propositional dynamic logic of regular programs
– Fisher, Ladner
- 1979
|
|
29
|
On the complexity of conditional logic
– Friedman, Halpern
- 1994
|
|
26
|
Proof systems for satisfiability in hennessy-milner logic with recursion
– Larsen
- 1990
|
|
24
|
Formalizing database evolution in the situation calculus. Fifth Generation Computer Systems
– Reiter
- 1992
|
|
16
|
Nondeterministic actions and the frame problem
– Boutilier, Friedman
- 1995
|
|
16
|
Description logics with inverse roles, functional restrictions, and n-ary relations
– Giacomo, Lenzerini
- 1994
|
|
13
|
The projection problem in the situation calculus: a soundness and completeness result, with an application to database updates
– Reiter
- 1992
|
|
13
|
Plan synthesis: a logical ap- proach
– Rosenschein
- 1981
|
|
12
|
Propositional dynamic logic of programs: A survey
– Parikh
- 1981
|
|
10
|
1995a], Enhanced propositional dynamic logic for reasoning about concurrent actions (extended abstract
– Giacomo, Lenzerini
|
|
7
|
A first order dynamic logic for planning
– Kautz
- 1982
|
|
4
|
This article was processed using the L a T E X macro package with LLNCS style
– Press, Oxford
- 1994
|
|
2
|
Intention is choice with communication
– Cohen, Levesque
- 1990
|
|
2
|
Propositional state event logic
– Grosse
- 1994
|
|
2
|
Algebraic laws for nondetrminism and concurrency
– Hennessy, Milner
- 1985
|
|
