Sciweavers

20 search results - page 3 / 4
» The Log-Support Encoding of CSP into SAT
Sort
View
ISMVL
2009
IEEE
107views Hardware» more  ISMVL 2009»
14 years 2 months ago
Regular Encodings from Max-CSP into Partial Max-SAT
We define a number of original encodings, called regular encodings, that map Max-CSP instances into Partial MaxSAT instances. First, we obtain new direct and (minimal) support en...
Josep Argelich, Alba Cabiscol, Inês Lynce, F...
CP
2010
Springer
13 years 6 months ago
A Complete Multi-valued SAT Solver
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
Siddhartha Jain, Eoin O'Mahony, Meinolf Sellmann
ICTAI
2002
IEEE
14 years 26 days ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali
CP
2003
Springer
14 years 1 months ago
Solving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
Simon de Givry, Javier Larrosa, Pedro Meseguer, Th...
AAAI
2006
13 years 9 months ago
Temporal Preference Optimization as Weighted Constraint Satisfaction
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
Michael D. Moffitt, Martha E. Pollack