283 search results - page 54 / 57 » Solving Over-Constrained Problems with SAT |
TABLEAUX
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
MICRO
2002
IEEE
14 years 2 months ago
2002
IEEE
Recently, graphics hardware architectures have begun to emphasize versatility, offering rich new ways to programmatically reconfigure the graphics pipeline. In this paper, we exp...
CP
2006
Springer
14 years 28 days ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...
FAW
2007
Springer
14 years 3 months ago
2007
Springer
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...