---
title: "Heuristics Based on Unit Propagation for Satisfiability Problems"
authors:
  - "Chu Min Li"
  - "Anbulagan"
doi: ""
url: "https://ijcai.org/proceedings/1997/54"
pdf: "https://ijcai.org/proceedings/1997/0054.pdf"
venue: "Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence"
year: 1997
pages: "366-370"
track: "Constraint Satisfaction"
keywords:
---

# Heuristics Based on Unit Propagation for Satisfiability Problems

Chu Min Li, Anbulagan

*Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence*, pages 366-370.

## 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 different 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).