000 03715nam a22004815i 4500
001 978-1-4020-5571-3
003 DE-He213
005 20161121230523.0
007 cr nn 008mamaa
008 100301s2006 ne | s |||| 0|eng d
020 _a9781402055713
_9978-1-4020-5571-3
024 7 _a10.1007/978-1-4020-5571-3
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aUL
_2bicssc
072 7 _aCOM051230
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aSAT 2005
_h[electronic resource] :
_bSatisfiability Research in the Year 2005 /
_cedited by Enrico Giunchiglia, Toby Walsh.
264 1 _aDordrecht :
_bSpringer Netherlands,
_c2006.
300 _aVII, 293 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aSatisfiability 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 _aThis 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 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aComputers.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aSoftware Engineering/Programming and Operating Systems.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aTheory of Computation.
700 1 _aGiunchiglia, Enrico.
_eeditor.
700 1 _aWalsh, Toby.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781402045523
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4020-5571-3
912 _aZDB-2-SCS
950 _aComputer Science (Springer-11645)
999 _c499991
_d499991