Combining SAT Methods with Non-Clausal Decision Heuristics1

https://doi.org/10.1016/j.entcs.2004.09.042Get rights and content
Under a Creative Commons license
open access

Abstract

A decision procedure for arbitrary first-order formulas can be viewed as combining a propositional search with a decision procedure for conjunctions of first-order literals, so Boolean SAT methods can be used for the propositional search in order to improve the performance of the overall decision procedure. We show how to combine some Boolean SAT methods with non-clausal heuristics developed for first-order decision procedures. The combination of methods leads to a smaller number of decisions than either method alone.

Keywords

satisfiability modulo theories
Boolean satisfiability
non-clausal
decision heuristics
CVC Lite

Cited by (0)

1

This research was supported by a grant from Intel Corporation. The content of this paper does not necessarily reflect the position or the policy of Intel.