ML Anthology

Combining Inference and Search for the Propositional Satisfiability Problem

Lyndon Drake, Alan M. Frisch
AAAI 2002 pp. 982
doi:10.5555/777092.777255 /aaai/2002/drake2002aaai-combining/

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.

PDF AAAI Semantic Scholar

Cite

Text

Drake and Frisch. "Combining Inference and Search for the Propositional Satisfiability Problem." AAAI Conference on Artificial Intelligence, 2002. doi:10.5555/777092.777255

Markdown

[Drake and Frisch. "Combining Inference and Search for the Propositional Satisfiability Problem." AAAI Conference on Artificial Intelligence, 2002.](https://mlanthology.org/aaai/2002/drake2002aaai-combining/) doi:10.5555/777092.777255

BibTeX

@inproceedings{drake2002aaai-combining,
  title     = {{Combining Inference and Search for the Propositional Satisfiability Problem}},
  author    = {Drake, Lyndon and Frisch, Alan M.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2002},
  pages     = {982},
  doi       = {10.5555/777092.777255},
  url       = {https://mlanthology.org/aaai/2002/drake2002aaai-combining/}
}