610 search results - page 45 / 122 » Using SAT in QBF |
SPLC
2008
13 years 9 months ago
2008
A configuration process is about finding a configuration, a setting, that satisfies the requirements given by the user and constraints imposed by the domain. Feature models are us...
SARA
2009
Springer
14 years 2 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
JCIT
2008
13 years 7 months ago
2008
This paper was utilized robust model to simulate sea surface current pattern. The horizontal surface velocity model was modified based on the Doppler frequency theory to model the...
FOCI
2007
IEEE
14 years 2 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
ENTCS
2006
13 years 7 months ago
2006
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...