Sciweavers

101 search results - page 13 / 21
» sat 2009
Sort
View
SAT
2009
Springer
121views Hardware» more  SAT 2009»
14 years 4 months ago
The Complexity of Reasoning for Fragments of Default Logic
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
SAT
2009
Springer
113views Hardware» more  SAT 2009»
14 years 4 months ago
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
Albert Atserias, Johannes Klaus Fichte, Marc Thurl...
CAV
2009
Springer
139views Hardware» more  CAV 2009»
14 years 10 months ago
A Concurrent Portfolio Approach to SMT Solving
With the availability of multi-core processors and large-scale computing clusters, the study of parallel algorithms has been revived throughout the industry. We present a portfolio...
Christoph M. Wintersteiger, Leonardo Mendonç...
CSL
2009
Springer
14 years 4 months ago
On the Parameterised Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
Stephan Kreutzer
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 4 months ago
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
Dániel Marx, Igor Razgon