Buch, Englisch, 293 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 458 g
Satisfiability Research in the Year 2005
Buch, Englisch, 293 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 458 g
ISBN: 978-94-007-8715-5
Verlag: Springer Netherlands
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik EDV & Informatik Allgemein
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
Weitere Infos & Material
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.
