67 search results - page 9 / 14 » Lower Bounds for the Complexity of Monadic Second-Order Logi... |
ESA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
LOGCOM
2002
13 years 7 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
- The problem of determining lower bounds for the energy cost of a given nanoscale design is addressed via a complexity theory-based approach. This paper provides a theoretical fra...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
FOSSACS
2007
Springer
14 years 1 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...