1 option
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 / edited by Carsten Sinz, Uwe Egly.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 8561
- Theoretical Computer Science and General Issues, 2512-2029 ; 8561
- Language:
- English
- Subjects (All):
- Computer science.
- Artificial intelligence.
- Computer science-Mathematics.
- Theory of Computation.
- Artificial Intelligence.
- Mathematics of Computing.
- Local Subjects:
- Theory of Computation.
- Artificial Intelligence.
- Mathematics of Computing.
- Physical Description:
- 1 online resource (XXVI, 448 pages) : 77 illustrations
- Edition:
- 1st ed. 2014.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2014.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-09284-3
- 9783319092843
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.