BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
1 × Portugal
2 × Canada
3 × United Kingdom
4 × USA
Collaborated with:
J.Argelich C.Ansótegui C.M.Li A.Cabiscol J.Planes M.L.Bonet J.Levy I.Lynce R.Béjar T.Alsinet Z.Quan Z.Zhu N.O.Mohamedou C.Fernández C.P.Gomes
Talks about:
sat (12) max (10) problem (5) variabl (4) partial (3) solver (3) valu (3) mani (3) map (3) csp (3)

Person: Felip Manyà

DBLP DBLP: Many=agrave=:Felip

Contributed to:

SAT 20112011
SAT 20102010
SAT 20092009
SAT 20082008
SAT 20072007
SAT 20062006
SAT 20052005
SAT 20042004
SAT 20042005
SAT 20022002
SAT 20012001

Wrote 15 papers:

SAT-2011-ArgelichLMP #evaluation #satisfiability
Analyzing the Instances of the MaxSAT Evaluation (JA, CML, FM, JP), pp. 360–361.
SAT-2010-LiMQZ #satisfiability
Exact MinSAT Solving (CML, FM, ZQ, ZZ), pp. 363–368.
SAT-2009-ArgelichCLM #encoding #satisfiability
Sequential Encodings from Max-CSP into Partial Max-SAT (JA, AC, IL, FM), pp. 161–166.
SAT-2009-LiMMP #satisfiability
Exploiting Cycle Structures in Max-SAT (CML, FM, NOM, JP), pp. 467–480.
SAT-2008-ArgelichCLM #modelling #satisfiability
Modelling Max-CSP as Partial Max-SAT (JA, AC, IL, FM), pp. 1–14.
SAT-2008-ArgelichLM #preprocessor #satisfiability
A Preprocessor for Max-SAT Solvers (JA, CML, FM), pp. 15–20.
SAT-2007-AnsoteguiBLM #csp #satisfiability
Mapping CSP into Many-Valued SAT (CA, MLB, JL, FM), pp. 10–15.
SAT-2007-ArgelichM #learning #satisfiability
Partial Max-SAT Solvers with Clause Learning (JA, FM), pp. 28–40.
SAT-2006-BonetLM #calculus #satisfiability
A Complete Calculus for Max-SAT (MLB, JL, FM), pp. 240–251.
SAT-2005-AlsinetMP #satisfiability
Improved Exact Solvers for Weighted Max-SAT (TA, FM, JP), pp. 371–377.
SAT-2005-ArgelichM #problem #satisfiability
Solving Over-Constrained Problems with SAT Technology (JA, FM), pp. 1–15.
SAT-2004-AnsoteguiM #problem
Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables (CA, FM), pp. 111–119.
SAT-J-2004-AnsoteguiM05 #problem
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables (CA, FM), pp. 1–15.
Resolution methods for many-valued CNF formulas (FM, CA, RB, AC, CML), p. 42.
SAT-2001-BejarCFMG #logic #satisfiability
Extending the Reach of SAT with Many-Valued Logics (RB, AC, CF, FM, CPG), pp. 392–407.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.