176 search results - page 5 / 36 » Constraint solvers: An empirical evaluation of design decisi... |
CP
1998
Springer
15 years 1 months ago
1998
Springer
In this paper we describe a paradigm for contentfocused matchmaking, based on a recently proposed model for constraint acquisition-and-satisfaction. Matchmaking agents are conceiv...
105
click to vote
CSCLP
2004
Springer
15 years 3 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
SAT
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...
JAIR
2008
14 years 9 months ago
2008
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
186
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...