132 search results - page 15 / 27 » Lower bounds for modal logics |
SIAMCOMP
2000
14 years 10 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
WSC
2007
15 years 19 days ago
2007
The HLA time management is an important factor that limits the scalability of distributed simulations. An efficient algorithm of Greatest Available Logical Time (GALT) is thus muc...
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
ENTCS
2007
14 years 10 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
DATE
2005
IEEE
15 years 4 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...