By the same authors

Combining Inference and Search for the Propositional Satisfiability Problem

Research output: Contribution to conferencePaper

Author(s)

Department/unit(s)

Publication details

DatePublished - 2002
Original languageUndefined/Unknown

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.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations