100 search results - page 11 / 20 » sat 2005 |
CHARME
2005
Springer
14 years 8 days ago
2005
Springer
The evolution of SAT technology over the last decade has motivated its application in model checking, initially through the utilization of SAT in bounded model checking (BMC) and, ...
VMCAI
2005
Springer
14 years 5 days ago
2005
Springer
Abstract. It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample min...
SAT
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...
GECCO
2005
Springer
14 years 7 days ago
2005
Springer
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
LPAR
2005
Springer
14 years 6 days ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...