Dynamic Polarity Adjustment in a Parallel SAT Solver

Guo, Long; Lagniez, Jean-Marie

doi:10.1109/ictai.2011.19

Search citation statements

Order By: Relevance

Paper Sections

Select...

Cmp: Step-by-step Presentation1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

2023

Publication Types

Select...

Book3

Article1

Relationship

Self Cite1

Independent3

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In CDCL-SAT solvers, the progress-saving interpretation captures the final state of variables which can hopefully exhibit a "good" approximation of an MSS of Σ. Moreover, the facilities provided by CDCL-SAT solvers to record useful information like the final state of variables ordering, the polarity cache and clause deletion/restart strategies for subsequent calls to the solver, can be exploited as well (Audemard et al 2011;Guo and Lagniez 2011).…”

Section: Cmp: Step-by-step Presentationmentioning

confidence: 99%

An Experimentally Efficient Method for (MSS,CoMSS) Partitioning

Grégoire

Lagniez

Mazure

2014

AAAI

Self Cite

View full text Add to dashboard Cite

The concepts of MSS (Maximal Satisfiable Subset) andCoMSS (also called Minimal Correction Subset) playa key role in many A.I. approaches and techniques. Inthis paper, a novel algorithm for partitioning a BooleanCNF formula into one MSS and the correspondingCoMSS is introduced. Extensive empirical evaluationshows that it is more robust and more efficient on mostinstances than currently available techniques.

show abstract

Section: Cmp: Step-by-step Presentationmentioning

confidence: 99%