000 04782nam a22005535i 4500
001 978-3-319-09284-3
003 DE-He213
005 20240730172256.0
007 cr nn 008mamaa
008 140702s2014 sz | s |||| 0|eng d
020 _a9783319092843
_9978-3-319-09284-3
024 7 _a10.1007/978-3-319-09284-3
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aTheory and Applications of Satisfiability Testing - SAT 2014
_h[electronic resource] :
_b17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings /
_cedited by Carsten Sinz, Uwe Egly.
250 _a1st ed. 2014.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXXVI, 448 p. 77 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8561
505 0 _aA (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.
520 _aThis 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.
650 0 _aComputer science.
_99832
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer science
_xMathematics.
_93866
650 1 4 _aTheory of Computation.
_9102752
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aMathematics of Computing.
_931875
700 1 _aSinz, Carsten.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9102754
700 1 _aEgly, Uwe.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9102755
710 2 _aSpringerLink (Online service)
_9102756
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319092836
776 0 8 _iPrinted edition:
_z9783319092850
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8561
_9102757
856 4 0 _uhttps://doi.org/10.1007/978-3-319-09284-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c88161
_d88161