SAT 2005: Satisfiability Research in the Year 2005 - Image 1

£84.39

Springer SAT 2005: Satisfiability Research in the Year 2005

Name: SAT 2005: Satisfiability Research in the Year 2005
Brand: Springer
Price: 84.39 GBP
Availability: InStock

AI & Machine Learning

It has never been this cheap. We have no record of a lower price.

£84 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 72 days · 72 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 72 days • 4 price levels

Days at Price

Current Price

Price Analysis

Most common price: £86 (54 days, 75.0%)

Price range: £84 - £94

Price levels: 4 different prices over 72 days

Description

This book covers recent progress in solving propositional satisfiability and related problems. Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. This book follows on from the highly successful volume entitled SAT 2000 published five years ago. From the Back Cover This book is devoted to recent progress made in solving propositional satisfiability and related problems. 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. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. In 1957, Allen Newell and Herb Simon introduced the Logic Theory Machine to prove propositional theorems from Whitehead and Russel's "Principia mathematica". In 1960, Martin Davis and Hillary Putnam introduced their eponymous decision procedure for satisfiability reasoning (though, for space reasons, it was quickly superseded by the modified procedure proposed by Martin Davis, George Logemann and Donald Loveland two years later). In 1971, Stephen Cook's proof that propositional satisfiability is NP-Complete placed satisfiability as the cornerstone of complexity theory. As this volume demonstrates, research has continued very actively in this area since then. This book follows on from the highly successful volume entitled SAT 2000 published five years ago. The papers in SAT 2005 fall (not entirely neatly) into the following categories: complete methods, local and stochastic search methods, random problems, applications, and extensions beyond the propositional.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 1402045522
Category: Books > Subjects > Computing & Internet > Computer Science > AI & Machine Learning
Domain: Amazon UK
Release Date: 30 October 2006
Listed Since: 18 January 2007

Barcode

No barcode data available

Springer SAT 2005: Satisfiability Research in the Year 2005

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Springer SAT 2005: Satisfiability Research in the Year 2005

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

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)

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

Logic for Computer Science and Artificial Intelligence

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

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

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

Philosophical Logic: Current Trends in Asia: Proceedings of AWPL-TPLC 2016 (Logic in Asia: Studia Logica Library)

Logics for Computer and Data Sciences, and Artificial Intelligence: 992 (Studies in Computational Intelligence, 992)

Mathematical Logic through Python

Introduction to Mathematical Logic: Extended Edition

Logic Colloquium '95: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Haifa, Israel, August 9–18, 1995: 11 (Lecture Notes in Logic, Series Number 11)

Symbolic Logic (Palgrave Philosophy Today)

Mathematical Aspects of Logic Programming Semantics (Chapman & Hall/CRC Studies in Informatics Series)

Substructural Logics: A Primer: 13 (Trends in Logic, 13)

The Logic of Sortals: A Conceptualist Approach: 408 (Synthese Library, 408)

Three-valued paraconsistent logics and their extensions: Three-valued paraconsistent logics

Decidability of Logical Theories and Their Combination (Studies in Universal Logic)

Basic Proof Theory 2ed: 43 (Cambridge Tracts in Theoretical Computer Science, Series Number 43)

Proof Complexity Generators: Series Number 497 (London Mathematical Society Lecture Note Series, Series Number 497)

Logical Foundations of Proof Complexity (Perspectives in Logic)

Oxford University Press - Fragments of First-Order Logic