Difference between revisions of "Publications/vallade.20.nfm"

From LRDE

(Created page with "{{Publication | published = true | date = 2020-08-01 | authors = Vincent Vallade, Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon | title = On the Usefulness...")
 
 
Line 11: Line 11:
 
| abstract = In the context of parallel SATisfiability solving, this paper presents an implementation and evaluation of a clause strengthening algorithm. The developed component can be easily combined with (virtually) any CDCL-like SAT solver. Our implementation is integrated as a part of Painless, a generic and modular framework for building parallel SAT solvers.
 
| abstract = In the context of parallel SATisfiability solving, this paper presents an implementation and evaluation of a clause strengthening algorithm. The developed component can be easily combined with (virtually) any CDCL-like SAT solver. Our implementation is integrated as a part of Painless, a generic and modular framework for building parallel SAT solvers.
 
| lrdepaper = http://www.lrde.epita.fr/dload/papers/vallade.20.nfm.pdf
 
| lrdepaper = http://www.lrde.epita.fr/dload/papers/vallade.20.nfm.pdf
| lrdekeywords = Parallel satisfiability, tool, strengthening, clause sharingportfolio, divide-and-conquer
+
| lrdekeywords = Parallel satisfiability, tool, strengthening, clause sharing, portfolio, divide-and-conquer
 
| type = inproceedings
 
| type = inproceedings
 
| id = vallade.20.nfm
 
| id = vallade.20.nfm

Latest revision as of 10:58, 8 September 2021

Abstract

In the context of parallel SATisfiability solving, this paper presents an implementation and evaluation of a clause strengthening algorithm. The developed component can be easily combined with (virtually) any CDCL-like SAT solver. Our implementation is integrated as a part of Painless, a generic and modular framework for building parallel SAT solvers.

Documents

Bibtex (lrde.bib)

@InProceedings{	  vallade.20.nfm,
  author	= {Vincent Vallade and Ludovic {Le Frioux} and Souheib Baarir
		  and Julien Sopena and Fabrice Kordon},
  title		= {On the Usefulness of Clause Strengthening in Parallel
		  {SAT} Solving},
  booktitle	= {Proceedings of the 12th NASA Formal Methods Symposium
		  (NFM'20)},
  year		= 2020,
  month		= aug,
  volume	= {12229},
  pages		= {222--229},
  series	= {Lecture Notes in Computer Science},
  publisher	= {Springer, Cham},
  abstract	= {In the context of parallel SATisfiability solving, this
		  paper presents an implementation and evaluation of a clause
		  strengthening algorithm. The developed component can be
		  easily combined with (virtually) any CDCL-like SAT solver.
		  Our implementation is integrated as a part of Painless, a
		  generic and modular framework for building parallel SAT
		  solvers.}
}