Combining inference and search for the propositional satisfiability problem

Authors:
Lyndon Drake;Alan Frisch;Toby Walsh
Affiliations:
Computer Science Department, University of York, Heslington, York YO10 5DD, United Kingdom;Computer Science Department, University of York, Heslington, York YO10 5DD, United Kingdom;Cork Constraint Computation Centre, University College Cork, Cork, Ireland
Venue:
Eighteenth national conference on Artificial intelligence
Year:
2002

Citing 3
Cited 0

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Adding new clauses for faster local search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

The most effective complete method for testing propositional satisfiability (SAT) is backtracking search. Recent research suggests that adding more inference to SAT search procedures can improve their performance. This paper presents two ways to combine neighbour resolution (one such inference technique) with search.