49 search results - page 6 / 10 » On Market-Inspired Approaches to Propositional Satisfiabilit... |
FMCAD
2006
Springer
13 years 10 months ago
2006
Springer
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
AAAI
1994
13 years 8 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
CPAIOR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
EPIA
1997
Springer
13 years 11 months ago
1997
Springer
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
ion Randal E. Bryant1 , Daniel Kroening2 , Jo¨el Ouaknine3 , Sanjit A. Seshia4 , Ofer Strichman5 , and Bryan Brady4 1 Carnegie Mellon University, Pittsburgh 2 ETH Z¨urich 3 Oxfor...