Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
16,060
Generalizing Propositional Dynamic Logic
, 1998
"... A new semantics of Propositional Dynamic Logic (PDL) is given in terms of predicate transformers: Instead of associating the standard state transformer with each program, we model programs by operations on sets of states, operations which map postconditions to weakest liberal preconditions. This yie ..."
Abstract
- Add to MetaCart
A new semantics of Propositional Dynamic Logic (PDL) is given in terms of predicate transformers: Instead of associating the standard state transformer with each program, we model programs by operations on sets of states, operations which map postconditions to weakest liberal preconditions
Propositional dynamic logic of flowcharts
- Infor. and Control
, 1985
"... Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nondeterministic finite automata o~¢er atomic programs and tests (i.e., flowcharts), rather than regular expressions. While the resulting version of PDL, call it APDL, is clearly equivalent in expressive p ..."
Abstract
-
Cited by 14 (2 self)
- Add to MetaCart
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nondeterministic finite automata o~¢er atomic programs and tests (i.e., flowcharts), rather than regular expressions. While the resulting version of PDL, call it APDL, is clearly equivalent in expressive
Boosting the correspondence between description logics and propositional dynamic logics
- In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI’94
, 1994
"... propositional dynamic logics ..."
Analytic Cut for Propositional Dynamic Logic
"... We present a Gentzen system GPDL for Propositional Dynamic Logic, deriving the classical Segerberg axiomatization from our system. The main contribution consists in proving that the system presented is equivalent to a subsystem where only Analytic Cut of a special and restricted kind is permitted. T ..."
Abstract
- Add to MetaCart
We present a Gentzen system GPDL for Propositional Dynamic Logic, deriving the classical Segerberg axiomatization from our system. The main contribution consists in proving that the system presented is equivalent to a subsystem where only Analytic Cut of a special and restricted kind is permitted
Propositional dynamic logic with recursive programs
- In Proc. FOSSACS 2006, LNCS 3921
, 2006
"... Abstract. We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan 2004). We show that the satisfiability problem for this extension remains decidable, generalising known decida ..."
Abstract
-
Cited by 14 (0 self)
- Add to MetaCart
Abstract. We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan 2004). We show that the satisfiability problem for this extension remains decidable, generalising known
On Models for Propositional Dynamic Logic
- Theoretical Computer Science
, 1991
"... In this paper we study some foundational aspects of the theory of PDL. We prove a claim made by Parikh [12], namely, the existence of a Kripke model U that is universal in the sense that every other Kripke model M can be isomorphically embedded in it. Using this model we give different and particul ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
. Lastly, we briefly turn to Dynamic Algebras and show that the characteristic algebras of U is initial in the class of ?-continuous Dynamic Algebras. 1 Introduction Logics of Programs are formal systems for reasoning about the behavior of computer programs. In these formal systems, computer programs
An Alternative To The Iteration Operator Of Propositional Dynamic Logic
, 1996
"... In this paper we present an alternative to the iteration operator of Propositional Dynamic Logic (PDL) and a tableau system for the resulting logic. We show the correctness and completeness of the method. ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
In this paper we present an alternative to the iteration operator of Propositional Dynamic Logic (PDL) and a tableau system for the resulting logic. We show the correctness and completeness of the method.
Propositional Dynamic Logic of Nonregular Programs
- Journal of Computer and System Sciences
, 1983
"... this paper indicate that this line is extremely close to the original regular PDL ..."
Abstract
-
Cited by 34 (2 self)
- Add to MetaCart
this paper indicate that this line is extremely close to the original regular PDL
Model checking propositional dynamic logic with all extras
- Journal of Applied Logic
, 2005
"... This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context-free programs. The algorithm shows that the model checking problem for PDL remains PTIME-complete in the presence of all ..."
Abstract
-
Cited by 32 (6 self)
- Add to MetaCart
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context-free programs. The algorithm shows that the model checking problem for PDL remains PTIME-complete in the presence
Results 1 - 10
of
16,060
