Combining Inference and Search for the Propositional Satisfiability Problem

Lyndon Drake; Alan M. Frisch

Combining Inference and Search for the Propositional Satisfiability Problem

Computer Science

Research output: Contribution to conference › Paper › peer-review

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.

Original language	Undefined/Unknown
Pages	982
Publication status	Published - 2002

Access to Document

http://dl.acm.org/citation.cfm?id=777255

Cite this

@conference{b4da6a8385d74dcea8895ad467cb67b3,

title = "Combining Inference and Search for the Propositional Satisfiability Problem",

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.",

author = "Lyndon Drake and Frisch, {Alan M.}",

year = "2002",

language = "Undefined/Unknown",

pages = "982",

}

TY - CONF

T1 - Combining Inference and Search for the Propositional Satisfiability Problem

AU - Drake, Lyndon

AU - Frisch, Alan M.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

M3 - Paper

SP - 982

ER -