# Boolean satisfiability problem

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- 2014

While the union bound does not need any assumption on the independence of A1, . . . , An at all, it is a very weak bound, i.e… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- POPL
- 2005

We describe a software error-detection tool that exploits recent advances in boolean satisfiability (SAT) solvers. Our analysis… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Computer-Aided Design of…
- 2005

Recent advances in Boolean satisfiability have made it an attractive engine for solving many digital very-large-scale-integration… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- CADE
- 2002

The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- IEEE/ACM International Conference on Computer…
- 2001

One of the most important features of current state-of-the-art SAT solvers is the use of conflict based backtracking and learning… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Journal of Automated Reasoning
- 2001

Satisfiability problems and probabilistic models are core topics of artificial intelligence and computer science. This paper… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- IEEE Trans. Computers
- 1999

ÐThis paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Artif. Intell.
- 1996

We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- IEEE Trans. on CAD of Integrated Circuits and…
- 1992

This article describes the Boolean satis ability method for generating test patterns for single stuck at faults in combinational… (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Annals of Mathematics and Artificial Intelligence
- 1990

We describe an algorithm for the satisfiability problem of prepositional logic, which is significantly more efficient for this… (More)

Is this relevant?