Propositional Satisfiability (SAT) is often used as the underlying model for a significan

Lynce, I.

Marques-Silva, J. P.

English

Inês Lynce

João P. Marques-silva

CiteSeerX

An overview of backtrack search satisfiability algorithms

Southampton (e-Prints Soton)

A computing procedure for quantiﬁcation theory,

A Davis–Putnam enumeration procedure for linear pseudo-Boolean optimization,

A fast parallel SAT-solver – efﬁcient workload balancing, in:

A machine program for theorem-proving,

A new method for solving hard satisﬁability problems, in:

A rearrangement search strategy for determining propositional satisﬁ-ability, in:

A system for determining propositional logic theorems by applying values and rules to triplets that are generated from a formula

Algebraic simpliﬁcation techniques for propositional satisﬁability, in:

Algorithm portfolio design: theory vs. practice. in:

Algorithms for testing the satisﬁability of propositional formulae,

Algorithms for the satisﬁability (SAT) problem: As u r v e y ,i n :Satisﬁability Problem: Theory and Applications,

An assumption-based TMS,

Asynchronous weak-commitment search for solving distributed constraint satisfaction problems, in:

Boosting combinatorial search through randomization, in:

Branching rules for satisﬁability,

Combinational test generation using satisﬁability,

Domain-independent extensions to GSAT: Solving large structured satisﬁabilityproblems, in:

Efﬁciency and stability of hypergraph SAT algorithms, in:

Engineering an efﬁcient SAT solver, in:

Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition,

Experimental results on the cross-over point in satisﬁability problems, in:

Finding dominators in directed graphs,

Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis,

GRASP: A new search algorithm for satisﬁability, in:

Heavy-tailed phenomena in satisﬁability and constraint satisfaction problems,

Improvements to propositional satisﬁability search algorithms,

Improving satisﬁability algorithms by using recursive learning, in:

Improving satisﬁability algorithms with dominance and partitioning, in:

Integrating equivalency reasoning into Davis–Putnam procedure, in:

Look-ahead versus look-back for satisﬁability problems, in:

ModGen: Theorem proving by model generation, in:

New ideas for solving covering problems, in:

Nogood recording for static and dynamic constraint satisfaction problems, in:

On solving covering problems, in:

PaSAT: Parallel SAT-checking with lemma exchange: implementation and applications, in:

Performance measurement and analysis of certain search algorithms,

PSATO:a distributed propositional prover and its application to quasigroup problems,

Report on a SAT competition,

Satisﬁability testing with more reasoning and less guessing, in:

SATO: An efﬁcient propositional prover, in:

Solving propositional satisﬁability problems,

Solving satisﬁability in CAD problems, in:

Some results and experiments in programming techniques for propositional logic,

Test pattern generation using Boolean satisﬁability,

The propositional formula checker Heerhugo, in:

Using CSP look-back techniques to solve real-world SAT instances, in:

Using randomization and learning to solve hard real-world instances of satisﬁability, in:

An Overview of Backtrack Search Satisfiability Algorithms

http://eprints.soton.ac.uk/262049/1/jpms-amai03.pdf

An Overview of Backtrack Search Satisfiability Algorithms

Abstract

Similar works

Full text

Available Versions

CiteSeerX

Southampton (e-Prints Soton)