 | 2010 |
|---|
| 11 |       | Josep Argelich,
Alba Cabiscol,
Inês Lynce,
Felip Manyà:
New Insights into Encodings from MaxCSP into Partial MaxSAT.
ISMVL 2010: 46-52 |
| 2009 |
|---|
| 10 | | Ramón Béjar,
Alba Cabiscol,
Felip Manyà,
Jordi Planes:
Generating Hard Instances for MaxSAT.
ISMVL 2009: 191-195 |
| 9 | | Josep Argelich,
Alba Cabiscol,
Inês Lynce,
Felip Manyà:
Regular Encodings from Max-CSP into Partial Max-SAT.
ISMVL 2009: 196-202 |
| 8 | | Josep Argelich,
Alba Cabiscol,
Inês Lynce,
Felip Manyà:
Sequential Encodings from Max-CSP into Partial Max-SAT.
SAT 2009: 161-166 |
| 2008 |
|---|
| 7 | | Josep Argelich,
Alba Cabiscol,
Inês Lynce,
Felip Manyà:
Encoding Max-CSP into Partial Max-SAT.
ISMVL 2008: 106-111 |
| 6 | | Josep Argelich,
Alba Cabiscol,
Inês Lynce,
Felip Manyà:
Modelling Max-CSP as Partial Max-SAT.
SAT 2008: 1-14 |
| 2007 |
|---|
| 5 | | Ramón Béjar,
Felip Manyà,
Alba Cabiscol,
Cèsar Fernández,
Carla P. Gomes:
Regular-SAT: A many-valued approach to solving combinatorial problems.
Discrete Applied Mathematics 155(12): 1613-1626 (2007) |
| 2004 |
|---|
| 4 | | Carlos Ansótegui,
Ramón Béjar,
Alba Cabiscol,
Felip Manyà:
The Interface between P and NP in Signed CNF Formulas.
ISMVL 2004: 251-256 |
| 2002 |
|---|
| 3 | | Teresa Alsinet,
Ramón Béjar,
Alba Cabiscol,
Cèsar Fernández,
Felip Manyà:
Minimal and Redundant SAT Encodings for the All-Interval-Series Problem.
CCIA 2002: 139-144 |
| 2001 |
|---|
| 2 | | Ramón Béjar,
Alba Cabiscol,
Cèsar Fernández,
Felip Manyà,
Carla P. Gomes:
Capturing Structure with Satisfiability.
CP 2001: 137-152 |
| 1 | | Ramón Béjar,
Alba Cabiscol,
Cèsar Fernández,
Felip Manyà,
Carla P. Gomes:
Extending the Reach of SAT with Many-Valued Logics.
Electronic Notes in Discrete Mathematics 9: 392-407 (2001) |
Data released under the ODC-BY 1.0 license — See also our legal information page