Theory and Applications of Satisfiability Testing - SAT 2014 de Carsten Sinz

Theory and Applications of Satisfiability Testing - SAT 2014: 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings: Lecture Notes in Computer Science, cartea 8561

Carsten Sinz

Uwe Egly

This book constitutes the refereed proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing, SAT 2014, held as part of the Vienna Summer of Logic, VSL 2014, in Vienna, Austria, in July 2014. The 21 regular papers, 7 short papers and 4 tool papers presented together with 2 invited talks were carefully reviewed and selected from 78 submissions. The papers have been organized in the following topical sections: maximum satisfiability; minimal unsatisfiability; complexity and reductions; proof complexity; parallel and incremental (Q)SAT; applications; structure; simplification and solving; and analysis.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 426^.75 lei
20%

Preț: 315^.62 lei
20%

Preț: 320^.92 lei
15%

Preț: 426^.53 lei
20%

Preț: 313^.87 lei
20%

Preț: 355^.79 lei
20%

Preț: 355^.54 lei
20%

Preț: 355^.18 lei
20%

Preț: 390^.68 lei
20%

Preț: 392^.03 lei
20%

Preț: 498^.95 lei
20%

Preț: 390^.79 lei
20%

Preț: 495^.44 lei
20%

Preț: 498^.80 lei
20%

Preț: 498^.50 lei
20%

Preț: 355^.93 lei
20%

Preț: 639^.52 lei
20%

Preț: 499^.90 lei
20%

Preț: 498^.95 lei
20%

Preț: 270^.68 lei
20%

Preț: 321^.68 lei
20%

Preț: 391^.36 lei
20%

Preț: 322^.09 lei
20%

Preț: 498^.90 lei
20%

Preț: 312^.82 lei
20%

Preț: 496^.73 lei
20%

Preț: 463^.03 lei
20%

Preț: 531^.75 lei
15%

Preț: 496^.40 lei
20%

Preț: 497^.25 lei
20%

Preț: 498^.80 lei
20%

Preț: 461^.86 lei
20%

Preț: 355^.59 lei
20%

Preț: 324^.19 lei
Preț: 418^.19 lei
20%

Preț: 498^.59 lei
20%

Preț: 391^.28 lei
20%

Preț: 355^.69 lei
15%

Preț: 499^.72 lei
20%

Preț: 499^.40 lei
20%

Preț: 390^.42 lei
20%

Preț: 497^.75 lei
20%

Preț: 326^.81 lei
20%

Preț: 322^.32 lei
20%

Preț: 390^.42 lei
20%

Preț: 458^.84 lei
20%

Preț: 427^.09 lei
20%

Preț: 499^.90 lei
20%

Preț: 320^.72 lei

Specificații

ISBN-13: 9783319092836
ISBN-10: 3319092839
Pagini: 476
Ilustrații: XXVI, 448 p. 77 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.66 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

A (Biased) Proof Complexity Survey for SAT Practitioners.- Cores in Core Based MaxSat Algorithms: An Analysis.- Solving MaxSAT and #SAT on Structured CNF Formulas.- Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.- MUS Extraction Using Clausal Proofs.- On Computing Preferred MUSes and MCSes.- Conditional Lower Bounds for Failed Literals and Related Techniques.- Fixed-Parameter Tractable Reductions to SAT.- On Reducing Maximum Independent Set to Minimum Satisfiability.- Long Proofs of (Seemingly) Simple Formulas.- Proof Complexity and the Kneser-Lovász Theorem.- QBF Resolution Systems and Their Proof Complexities.- Unified Characterisations of Resolution Hardness Measures.- Community Branching for Parallel Portfolio SAT Solvers.- Lazy Clause Exchange Policy for Parallel SAT Solvers.- Ultimately Incremental SAT.- A SAT Attack on the Erdos Discrepancy Conjecture.- Dominant Controllability Check Using QBF-Solver and Netlist.- Fast DQBF Refutation.- Impact of Community Structure on SAT Solver Performance.- Variable Dependencies and Q-Resolution.- Detecting Cardinality Constraints in CNF.- Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses.- Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask).- Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions.- Simplifying Pseudo-Boolean Constraints in Residual Number Systems.- An Ising Model Inspired Extension of the Product-Based MP Framework for SAT.- Approximating Highly Satisfiable Random 2-SAT.- Hypergraph Acyclicity and Propositional Model Counting.- Automatic Evaluation of Reductions between NP-Complete Problems.- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs.- MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing.- Open-WBO: A Modular MaxSAT Solver.