Hidden Bibliographic Details
| Varying Form of Title: | Satisfiability research in the year 2005
|
|---|
| Other uniform titles: | Journal of automated reasoning. Vol. 35, no. 1-3.
|
|---|
| Other authors / contributors: | Giunchiglia, Enrico.
Walsh, Toby.
|
|---|
| ISBN: | 9781402055713
1402055714
|
|---|
| Notes: | "Reprinted from Journal of automated reasoning, v. 35, nos. 1-3 (2005)."
Includes bibliographical references.
Description based on print version record.
|
|---|
| Summary: | Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. The core of many reasoning problems in automated deduction are propositional. This work deals with the progress made in solving propositional satisfiability and related problems.
|
|---|
| Other form: | Print version: SAT 2005. Dordrecht : Springer, c2006 9781402045523 1402045522
|
|---|
