9 search results - page 1 / 2 » An Explicit Formula for the Free Exponential Modality of Lin... |
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
PLANX
2007
13 years 6 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
ACTA
2004
13 years 4 months ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
CADE
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
CHARME
2005
Springer
13 years 10 months ago
2005
Springer
Timing diagrams are useful for capturing temporal specifications in which all mentioned events are required to occur. We first show that translating timing diagrams with both par...