MARC details
| 000 -LEADER |
|---|
| fixed length control field |
03647nam a22004695i 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
978-1-4020-5571-3 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20170628033502.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
100301s2006 ne | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781402055713 |
| -- |
978-1-4020-5571-3 |
| 024 7# - OTHER STANDARD IDENTIFIER |
|---|
| Standard number or code |
10.1007/978-1-4020-5571-3 |
| Source of number or code |
doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
Q334-342 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
TJ210.2-211.495 |
| 072 #7 - SUBJECT CATEGORY CODE |
|---|
| Subject category code |
UYQ |
| Source |
bicssc |
| 072 #7 - SUBJECT CATEGORY CODE |
|---|
| Subject category code |
TJFM1 |
| Source |
bicssc |
| 072 #7 - SUBJECT CATEGORY CODE |
|---|
| Subject category code |
COM004000 |
| Source |
bisacsh |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
006.3 |
| Edition number |
23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Giunchiglia, Enrico. |
| Relator term |
editor. |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
SAT 2005 |
| Medium |
[electronic resource] : |
| Remainder of title |
Satisfiability Research in the Year 2005 / |
| Statement of responsibility, etc |
edited by Enrico Giunchiglia, Toby Walsh. |
| 264 #1 - |
|---|
| -- |
Dordrecht : |
| -- |
Springer Netherlands, |
| -- |
2006. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
VII, 293 p. |
| Other physical details |
online resource. |
| 336 ## - |
|---|
| -- |
text |
| -- |
txt |
| -- |
rdacontent |
| 337 ## - |
|---|
| -- |
computer |
| -- |
c |
| -- |
rdamedia |
| 338 ## - |
|---|
| -- |
online resource |
| -- |
cr |
| -- |
rdacarrier |
| 347 ## - |
|---|
| -- |
text file |
| -- |
PDF |
| -- |
rda |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Satisfiability in the Year 2005 -- Heuristic-Based Backtracking Relaxation for Propositional Satisfiability -- Symbolic Techniques in Satisfiability Solving -- Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas -- Backdoor Sets for DLL Subsolvers -- The Complexity of Pure Literal Elimination -- Clause Weighting Local Search for SAT -- Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings -- Regular Random k-SAT: Properties of Balanced Formulas -- Applying SAT Solving in Classification of Finite Algebras -- The SAT-based Approach to Separation Logic -- MathSAT: Tight Integration of SAT and Mathematical Decision Procedures. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Information theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Artificial intelligence. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Artificial Intelligence (incl. Robotics). |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Theory of Computation. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Walsh, Toby. |
| Relator term |
editor. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY |
|---|
| Title |
Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| Display text |
Printed edition: |
| International Standard Book Number |
9781402045523 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
<a href="http://dx.doi.org/10.1007/978-1-4020-5571-3">http://dx.doi.org/10.1007/978-1-4020-5571-3</a> |
| 912 ## - |
|---|
| -- |
ZDB-2-SCS |
