7092 search results - page 663 / 1419 » Parallelizing constraint programs |
192
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
142
click to vote
CP
2007
Springer
16 years 20 days ago
2007
Springer
Salinity is the relative concentration of salts in water. In a city of southern China, the local water supply company pumps water from a nearby river for potable use. During the wi...
163
click to vote
ACL
2008
15 years 8 months ago
2008
A desirable quality of a coreference resolution system is the ability to handle transitivity constraints, such that even if it places high likelihood on a particular mention being...
185
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
218
click to vote
JMLR
2012
13 years 9 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...