CDCL with Less Destructive Backtracking through Partial Ordering

15 pages•Published: August 19, 2013

Abstract

Conflict-driven clause learning is currently the most efficient complete algorithm for satisfiability solving. However, a conflict-directed backtrack deletes potentially large portions of the current assignment that have no direct relation with the conflict. In this paper, we show that the CDCL algorithm can be generalized with a partial ordering on decision levels. This allows keeping levels that would otherwise be undone during backtracking under the usual total ordering. We implement partial ordering CDCL in a state-of-the-art CDCL solver and show that it significantly ameliorates satisfiability solving on some series of benchmarks.

Keyphrases: automated reasoning, cdcl, partial order, propositional reasoning, sat

In: Pascal Fontaine, Renate A. Schmidt and Stephan Schulz (editors). PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning, vol 21, pages 124-138.

Links:	https://easychair.org/publications/paper/T45
	https://doi.org/10.29007/fblb

BibTeX entry

@inproceedings{PAAR-2012:CDCL_with_Less_Destructive,
  author    = {Anthony Monnet and Roger Villemaire},
  title     = {CDCL with Less Destructive Backtracking through Partial Ordering},
  booktitle = {PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Pascal Fontaine and Renate A. Schmidt and Stephan Schulz},
  series    = {EPiC Series in Computing},
  volume    = {21},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/T45},
  doi       = {10.29007/fblb},
  pages     = {124-138},
  year      = {2013}}

Download PDF Open PDF in browser