610 search results - page 108 / 122 » Using SAT in QBF |
ICST
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability across their features. This leads to combinatorial explosion of the n...
ECAI
2010
Springer
13 years 5 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...
JAIR
2011
13 years 2 months ago
2011
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
This paper attempts to quantify the optimality of FPGA technology mapping algorithms. We develop an algorithm, based on Boolean satisfiability (SAT), that is able to map a small s...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...