1997•Unpublished venueRequires access

Heuristics based on unit propagation for satisfiability problems

Chu Min Li, Anbu Anbulagan

Abstract

The paper studies new unit propagation based heuristics for Davis-Putnam-Loveland (DPL) procedure. These are the novel combinations of unit propagation and the usual "Maximum Occurrences in clauses of Minimum Size " heuristics. Based on the experimental evaluations of di erent alternatives a new simple unit propagation based heuristic is put forward. This compares favorably with the heuristics employed in the current state-of-the-art DPL implementations (C-SAT, Tableau, POSIT). 1

About this research paper

What this paper is about

Why it matters

OpenAlex reports 330 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Heuristics, Heuristic, Satisfiability, Computer science, Unit (ring theory), Simple (philosophy), Implementation, Boolean satisfiability problem