Combining inference and search for the propositional satisfiability problem

L Drake; A Frisch; T Walsh

Combining inference and search for the propositional satisfiability problem

L Drake, A Frisch, T Walsh

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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	English
Title of host publication	EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS
Place of Publication	CAMBRIDGE
Publisher	MIT Press
Pages	982-982
Number of pages	1
ISBN (Print)	0-262-51129-0
Publication status	Published - 2002
Event	AAAI-02 - Edmonton, Alberta, Canada Duration: 28 Jul 2002 → 1 Aug 2002

Conference

Conference	AAAI-02
Country/Territory	Canada
City	Edmonton, Alberta
Period	28/07/02 → 1/08/02

Cite this

@inproceedings{986d7f0a16b9431e87eba779cecd9825,

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 = "L Drake and A Frisch and T Walsh",

year = "2002",

language = "English",

isbn = "0-262-51129-0",

pages = "982--982",

booktitle = "EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS",

publisher = "MIT Press ",

address = "United States",

note = "AAAI-02 ; Conference date: 28-07-2002 Through 01-08-2002",

}

Combining inference and search for the propositional satisfiability problem. / Drake, L; Frisch, A; Walsh, T.
EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS. CAMBRIDGE: MIT Press , 2002. p. 982-982.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Combining inference and search for the propositional satisfiability problem

AU - Drake, L

AU - Frisch, A

AU - Walsh, T

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 - Conference contribution

SN - 0-262-51129-0

SP - 982

EP - 982

BT - EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS

PB - MIT Press

CY - CAMBRIDGE

T2 - AAAI-02

Y2 - 28 July 2002 through 1 August 2002

ER -