Theory and Applications of Satisfiability Testing - SAT 2013
Springer Berlin (Verlag)
978-3-642-39070-8 (ISBN)
Invited Talks.- The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs.- Turing's Computable Real Numbers and Why They Are Still Important Today.- There Are No CNF Problems.- Best Paper.- Soundness of Inprocessing in Clause Sharing SAT Solvers.- Technical Papers.- Propositional Proof Complexity I.- Exponential Separations in a Hierarchy of Clause Learning Proof Systems.- On the Resolution Complexity of Graph Non-isomorphism.- Quantified Boolean Formulas.- On Propositional QBF Expansions and Q-Resolution.- Recovering and Utilizing Partial Duality in QBF.- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation.- Parallel Solving.- Concurrent Clause Strengthening.- Parallel MUS Extraction.- Maximum Satisfiability.- A Modular Approach to MaxSAT Modulo Theories.- Exploiting the Power of mip Solvers in maxsat.- Community-Based Partitioning for MaxSAT Solving.- Encodings and Applications.- Experiments with Reduction Finding.- A Constraint Satisfaction Approach for Programmable Logic Detailed Placement.- Minimizing Models for Tseitin-Encoded SAT Instances.- Beyond SAT.- Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability.- Quantified Maximum Satisfiability: A Core-Guided Approach.- Nested Boolean Functions as Models for Quantified Boolean Formulas.- Solver Techniques and Algorithms.- Factoring Out Assumptions to Speed Up MUS Extraction.- On the Interpolation between Product-Based Message Passing Heuristics for SAT.- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction.- Clique-Width and SAT.- A SAT Approach to Clique-Width.- Cliquewidth and Knowledge Compilation.- Propositional Proof Complexity II.- A Rank Lower Bound for Cutting Planes Proofs of Ramsey's.- Theorem.- The Complexity of Theorem Proving in Autoepistemic Logic.- Parameterized Complexity.- Local Backbones.- Upper and Lower Bounds for Weak Backdoor SetDetection.- Tool Papers.- LearnSAT: A SAT Solver for Education.- MUStICCa: MUS Extraction with Interactive Choice of Candidates.- SCSat: A Soft Constraint Guided SAT Solver.- Snappy: A Simple Algorithm Portfolio.- Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems.
| Erscheint lt. Verlag | 19.7.2013 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XVI, 437 p. 84 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 694 g |
| Themenwelt | Informatik ► Software Entwicklung ► Qualität / Testen |
| Informatik ► Theorie / Studium ► Algorithmen | |
| Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
| Schlagworte | Algorithm analysis and problem complexity • Constraint Optimization • experimental finite model theory • Information and Communication, Circuits • proof complexity • SAT solvers • soft constraint |
| ISBN-10 | 3-642-39070-6 / 3642390706 |
| ISBN-13 | 978-3-642-39070-8 / 9783642390708 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
