504 search results - page 56 / 101 » The Complexity of Symmetry-Breaking Formulas |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
JCSS
2008
13 years 10 months ago
2008
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
CORR
1999
Springer
13 years 9 months ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
EMSOFT
2010
Springer
13 years 7 months ago
2010
Springer
Model-driven architecture (MDA) is a model-based approach for engineering complex software systems. MDA is particularly attractive for designing embedded systems because models ca...