By the same authors

Combining Inference and Search for the Propositional Satisfiability Problem

Research output: Contribution to conferencePaper

Standard

Combining Inference and Search for the Propositional Satisfiability Problem. / Drake, Lyndon; Frisch, Alan M.

2002. 982.

Research output: Contribution to conferencePaper

Harvard

Drake, L & Frisch, AM 2002, 'Combining Inference and Search for the Propositional Satisfiability Problem' pp. 982.

APA

Drake, L., & Frisch, A. M. (2002). Combining Inference and Search for the Propositional Satisfiability Problem. 982.

Vancouver

Drake L, Frisch AM. Combining Inference and Search for the Propositional Satisfiability Problem. 2002.

Author

Drake, Lyndon ; Frisch, Alan M. / Combining Inference and Search for the Propositional Satisfiability Problem.

Bibtex - Download

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

}

RIS (suitable for import to EndNote) - Download

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 -