There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 7

Record: found
Abstract: not found
Article: not found

A machine program for theorem-proving

Martin Davis, George Logemann, Donald Loveland (1962)

0 comments Cited 305 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

A Computing Procedure for Quantification Theory

Martin Davis, Hilary Putnam (1960)

0 comments Cited 222 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Solving propositional satisfiability problems

Jinchang Wang, Robert Jeroslow (1990)

0 comments Cited 19 times – based on 0 reviews      Review now

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2002

Publication date (Online): September 2 2002

Pages: 185-199

DOI: 10.1007/3-540-46135-3_13

SO-VID: b2b96c1a-15df-40bd-a32a-d154e7470494

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 11

Effective Preprocessing in SAT Through Variable and Clause Elimination
Authors: Niklas Een, Armin Biere
Blocked Clause Elimination for QBF
Authors: Armin Biere, Florian Lonsing, Martina Seidl
Blocked Clause Elimination
Authors: Matti Järvisalo, Armin Biere, Marijn Heule

See all cited by

Recovering and Exploiting Structural Knowledge from CNF Formulas

Read this book at

Related collections

Indigenous Knowledge

Most cited references 7

A machine program for theorem-proving

A Computing Procedure for Quantification Theory

Solving propositional satisfiability problems

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 3,629

Cited by 11