BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Finland
1 × Italy
1 × USA
Collaborated with:
G.Audemard A.Biere L.Simon B.Mazure L.Saïs D.L.Berre T.d.Lima V.Montmirail B.Hoessen S.Jabbour C.Piette
Talks about:
assumpt (3) solv (3) extract (2) claus (2) sat (2) mus (2) increment (1) parallel (1) approach (1) satisfi (1)

Person: Jean-Marie Lagniez

DBLP DBLP: Lagniez:Jean=Marie

Contributed to:

SAT 20132013
SAT 20122012
SAT 20112011
IJCAR 20182018

Wrote 5 papers:

SAT-2013-AudemardLS #incremental #satisfiability
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction (GA, JML, LS), pp. 309–317.
SAT-2013-LagniezB
Factoring Out Assumptions to Speed Up MUS Extraction (JML, AB), pp. 276–292.
SAT-2012-AudemardHJLP #parallel #satisfiability
Revisiting Clause Exchange in Parallel SAT Solving (GA, BH, SJ, JML, CP), pp. 200–213.
SAT-2011-AudemardLMS #on the
On Freezing and Reactivating Learnt Clauses (GA, JML, BM, LS), pp. 188–200.
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.