Price loading...

Satisfiability Problem: Theory and Applications (Series in Discrete Mathematics and Theoretical Computer Science)

Architecture & Microprocessors

Price data last checked 93 day(s) ago - refreshing...

View at Amazon

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. There has been a strong relationship between the theory, the algorithms, and the applications of the SAT problem. This book aims to bring together work by the best theorists, algorithmists, and practitioners working on the SAT problem and on industrial applications, as well as to enhance the interaction between the three research groups. The book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study.Major topics covered in the book include practical and industrial SAT problems and benchmarks, significant case studies and applications of the SAT problem and SAT algorithms, new algorithms and improved techniques for satisfiability testing, specific data structures and implementation details of the SAT algorithms, and the theoretical study of the SAT problem and SAT algorithms. It features: a comprehensive review of SAT research work over the past 25 years; the most recent research results; and a spectrum of algorithmic issues and applications.

Product Specifications

Format: hardcover
ASIN: 0821804790
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 19 February 1998
Listed Since: 17 October 2006

Barcode

No barcode data available

Satisfiability Problem: Theory and Applications (Series in Discrete Mathematics and Theoretical Computer Science)

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

Handbook of Satisfiability: Second Edition (Frontiers in Artificial Intelligence and Applications (IOS Press))

Computability Theory and Its Applications: Current Trends and Open Problems (Contemporary Mathematics)

SAT 2005: Satisfiability Research in the Year 2005

Springer SAT 2005: Satisfiability Research in the Year 2005

Logic for Applications (Texts in Computer Science)

Decision Procedures: An Algorithmic Point of View (Texts in Theoretical Computer Science. An EATCS Series)

Computation Engineering: Applied Automata Theory and Logic

Theory and Applications of Satisfiability Testing – SAT 2021: 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings: 12831 (Lecture Notes in Computer Science, 12831)

Sampling in Combinatorial and Geometric Set Systems (Mathematical Surveys and Monographs)

Language Computability and Formal Language Theory

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets (Monographs in Computer Science)

A Tale Of Discrete Mathematics: A Journey Through Logic, Reasoning, Structures And Graph Theory

Planning, Scheduling and Constraint Satisfaction: From Theory to Practice: v. 117 (Frontiers in Artificial Intelligence and Applications)

Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future (Series in Discrete Mathematics and Theoretical Computer Science)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Combinatorics of Nonnegative Matrices (Translations of Mathematical Monographs)

Set Theory and Its Applications (Contemporary Mathematics)

Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)

Declarative Logic Programming: Theory, Systems, and Applications (ACM Books)

Special Topics in Mathematics for Computer Scientists: Sets, Categories, Topologies and Measures

The Unknown Component Problem: Theory and Applications

A Formalization of Set Theory without Variables (Colloquium Publications)

Proof Theory: Sequent Calculi and Related Formalisms (Discrete Mathematics and Its Applications)