000 04667nam a22005295i 4500
001 vtls000543845
003 RU-ToGU
005 20210922083012.0
007 cr nn 008mamaa
008 160915s2014 gw | s |||| 0|eng d
020 _a9783319092843
_9978-3-319-09284-3
024 7 _a10.1007/978-3-319-09284-3
_2doi
035 _ato000543845
040 _aSpringer
_cSpringer
_dRU-ToGU
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aTheory and Applications of Satisfiability Testing – SAT 2014
_helectronic 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.
260 _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
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_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.
_9155490
650 0 _aInformation theory.
_9303504
650 0 _aArtificial intelligence.
_9274099
650 1 4 _aComputer Science.
_9155490
650 2 4 _aTheory of Computation.
_9303507
650 2 4 _aArtificial Intelligence (incl. Robotics).
_9274102
650 2 4 _aMathematics of Computing.
_9303612
700 1 _aSinz, Carsten.
_eeditor.
_9451970
700 1 _aEgly, Uwe.
_eeditor.
_9451971
710 2 _aSpringerLink (Online service)
_9143950
773 0 _tSpringer eBooks
830 0 _aLecture Notes in Computer Science,
_9279505
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-09284-3
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c402159