22 search results - page 1 / 5 » A Lower Complexity Bound for Propositional Dynamic Logic wit... |
AIML
2004
13 years 6 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
CSL
2006
Springer
13 years 4 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
FOSSACS
2007
Springer
13 years 10 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
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...
SAT
2010
Springer
13 years 8 months ago
2010
Springer
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...