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 × Austria
1 × Canada
1 × France
1 × USA
1 × United Kingdom
2 × Italy
Collaborated with:
L.Simon A.Tacchella S.Coste-Marquis F.Letombe G.Brewka S.Benferhat A.Biere E.Lonca N.Manthey M.Narizzano J.Lagniez T.d.Lima V.Montmirail C.Quinton A.Pleuß L.Duchien G.Botterweck H.Fargier J.Lang P.Marquis
Talks about:
solver (3) sat (3) qbf (3) quantifi (2) competit (2) formula (2) cardin (2) evalu (2) base (2) constraint (1)

Person: Daniel Le Berre

DBLP DBLP: Berre:Daniel_Le

Contributed to:

SAT 20142014
SPLC 20142014
KR 20062006
SAT 20052005
SAT 20042005
SAT 20032003
KR 20022002
SAT 20012001
IJCAR 20182018

Wrote 11 papers:

SAT-2014-BiereBLM #constraints #detection
Detecting Cardinality Constraints in CNF (AB, DLB, EL, NM), pp. 285–301.
SPLC-2014-QuintonPBDB #consistency #evolution #feature model #modelling
Consistency checking for the evolution of cardinality-based feature models (CQ, AP, DLB, LD, GB), pp. 122–131.
KR-2006-Coste-MarquisFLBM #policy #quantifier #representation
Representing Policies for Quantified Boolean Formulae (SCM, HF, JL, DLB, PM), pp. 286–297.
SAT-2005-Coste-MarquisBL #branch #heuristic #quantifier
A Branching Heuristics for Quantified Renamable Horn Formulas (SCM, DLB, FL), pp. 393–399.
SAT-J-2004-BerreNST05 #comparative #evaluation
The Second QBF Solvers Comparative Evaluation (DLB, MN, LS, AT), pp. 376–392.
SAT-J-2004-BerreS05 #contest #satisfiability
Fifty-Five Solvers in Vancouver: The SAT 2004 Competition (DLB, LS), pp. 321–344.
SAT-2003-BerreS #contest #satisfiability
The Essentials of the SAT 2003 Competition (DLB, LS), pp. 452–467.
SAT-2003-BerreST #challenge #evaluation #satisfiability
Challenges in the QBF Arena: the SAT’03 Evaluation of QBF Solvers (DLB, LS, AT), pp. 468–485.
KR-2002-BrewkaBB #logic
Qualitative Choice Logic (GB, SB, DLB), pp. 158–169.
SAT-2001-Berre #lookahead #power of
Exploiting the real power of unit propagation lookahead (DLB), pp. 59–80.
IJCAR-2018-LagniezBLM #approach #problem #satisfiability
An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem (JML, DLB, TdL, VM), pp. 1–18.

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.