SAT 2005 Satisfiability Research in the Year 2005 /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Giunchiglia, Enrico (Επιμελητής έκδοσης), Walsh, Toby (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Dordrecht : Springer Netherlands, 2006.
• Θέματα: Computer science.; Software engineering.; Computers.; Artificial intelligence.; Computer Science.; Software Engineering/Programming and Operating Systems.; Artificial Intelligence (incl. Robotics).; Theory of Computation.

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 proble...

Πίνακας περιεχομένων:

• 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.