Linear Refutation and Clause Splitting

EasyChair Preprint 9423

Abstract

Linear resolution is one of the ancient methods for first-order theorem proving. We extend linear resolution with clause splitting, producing subgoals dispatched independently. An incremental SAT solver keeps track of refutations and thus provides a “lemma” mechanism. We describe some implementation considerations, present some initial experimental results, and discuss future directions for this approach.

Keyphrases: Boolean satisfiability, clause splitting, linear resolution

@booklet{EasyChair:9423,
  author    = {Michael Rawson},
  title     = {Linear Refutation and Clause Splitting},
  howpublished = {EasyChair Preprint 9423},
  year      = {EasyChair, 2022}}