國立虎尾科技大學 |

Theory and Applications of Satisfiability Testing – SAT 2016 = 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Theory and Applications of Satisfiability Testing – SAT 2016/ edited by Nadia Creignou, Daniel Le Berre.
Reminder of title:	19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings /
other author:	Creignou, Nadia.
Description:	XXIV, 564 p. 119 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computers. -
Online resource:	https://doi.org/10.1007/978-3-319-40970-2
ISBN:	9783319409702

Theory and Applications of Satisfiability Testing – SAT 2016 = 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings /
Theory and Applications of Satisfiability Testing – SAT 201619th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings /[electronic resource] :edited by Nadia Creignou, Daniel Le Berre. - 1st ed. 2016. - XXIV, 564 p. 119 illus.online resource. - Theoretical Computer Science and General Issues ;9710. - Theoretical Computer Science and General Issues ;9163.

Parameterized Compilation Lower Bounds for Restricted CNF-formulas -- Satisfiability via Smooth Pictures -- Solution-Graphs of Boolean Formulas and Isomorphism -- Strong Backdoors for Default Logic -- The Normalized Autocorrelation Length of Max r-Sat Converges in Probability to (1-1/2=r)/r -- Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle -- Extreme Cases in SAT Problems -- Improved Static Symmetry Breaking for SAT -- Learning Rate Based Branching Heuristic for SAT Solvers -- On the Hardness of SAT with Community Structure -- Trade-offs between Time and Memory in a Tighter Model of CDCL SAT Solvers -- A SAT Approach to Branch Width -- Computing Maximum Unavoidable Subgraphs Using SAT Solvers -- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT -- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer -- Deciding Bit-Vector Formulas with mcSAT -- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams -- Speeding Up the Constraint-Based Method in Difference Logic -- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers -- Finding Finite Models in Multi-Sorted First Order Logic -- MCS Extraction with Sublinear Oracle Queries -- Predicate Elimination for Preprocessing in First-Order Theorem Proving -- Quantified Boolean Formula Incremental Determinization -- Non-prenex QBF Solving using Abstraction -- On Q-Resolution and CDCL QBF Solving -- On Stronger Calculi for QBFs -- Q-Resolution with Generalized Axioms -- 2QBF: Challenges and Solutions -- Dependency Schemes for DQBF -- Lifting QBF Resolution Calculi to DQBF -- Long Distance Q-Resolution with Dependency Schemes -- BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies -- HordeQBF: A Modular and Massively Parallel QBF Solver -- LMHS: A SAT-IP Hybrid MaxSAT Solver -- OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing -- SpyBug: Automated Bug Detection in the Con_guration Space of SAT Solvers. .

This book constitutes the refereed proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016, held in Bordeaux, France, in July 2016. The 31 regular papers, 5 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including complexity, satisfiability solving, satisfiability applications, satisfiability modulop theory, beyond SAT, quantified Boolean formula, and dependency QBF. .

ISBN: 9783319409702

Standard No.: 10.1007/978-3-319-40970-2doiSubjects--Topical Terms:

565115
Computers.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Theory and Applications of Satisfiability Testing – SAT 2016 = 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings /
LDR:04076nam a22004335i 4500 001 981243
003 DE-He213
005 20200702230458.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319409702 $9 978-3-319-40970-2
024 7 $a 10.1007/978-3-319-40970-2 $2 doi
035 $a 978-3-319-40970-2
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Theory and Applications of Satisfiability Testing – SAT 2016 $h [electronic resource] : $b 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings / $c edited by Nadia Creignou, Daniel Le Berre.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XXIV, 564 p. 119 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 9710
505 0 $a Parameterized Compilation Lower Bounds for Restricted CNF-formulas -- Satisfiability via Smooth Pictures -- Solution-Graphs of Boolean Formulas and Isomorphism -- Strong Backdoors for Default Logic -- The Normalized Autocorrelation Length of Max r-Sat Converges in Probability to (1-1/2=r)/r -- Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle -- Extreme Cases in SAT Problems -- Improved Static Symmetry Breaking for SAT -- Learning Rate Based Branching Heuristic for SAT Solvers -- On the Hardness of SAT with Community Structure -- Trade-offs between Time and Memory in a Tighter Model of CDCL SAT Solvers -- A SAT Approach to Branch Width -- Computing Maximum Unavoidable Subgraphs Using SAT Solvers -- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT -- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer -- Deciding Bit-Vector Formulas with mcSAT -- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams -- Speeding Up the Constraint-Based Method in Difference Logic -- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers -- Finding Finite Models in Multi-Sorted First Order Logic -- MCS Extraction with Sublinear Oracle Queries -- Predicate Elimination for Preprocessing in First-Order Theorem Proving -- Quantified Boolean Formula Incremental Determinization -- Non-prenex QBF Solving using Abstraction -- On Q-Resolution and CDCL QBF Solving -- On Stronger Calculi for QBFs -- Q-Resolution with Generalized Axioms -- 2QBF: Challenges and Solutions -- Dependency Schemes for DQBF -- Lifting QBF Resolution Calculi to DQBF -- Long Distance Q-Resolution with Dependency Schemes -- BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies -- HordeQBF: A Modular and Massively Parallel QBF Solver -- LMHS: A SAT-IP Hybrid MaxSAT Solver -- OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing -- SpyBug: Automated Bug Detection in the Con_guration Space of SAT Solvers. .
520 $a This book constitutes the refereed proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016, held in Bordeaux, France, in July 2016. The 31 regular papers, 5 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including complexity, satisfiability solving, satisfiability applications, satisfiability modulop theory, beyond SAT, quantified Boolean formula, and dependency QBF. .
650 0 $a Computers. $3 565115
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Software engineering. $3 562952
650 1 4 $a Theory of Computation. $3 669322
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Software Engineering. $3 669632
700 1 $a Creignou, Nadia. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 528371
700 1 $a Le Berre, Daniel. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1110077
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319409696
776 0 8 $i Printed edition: $z 9783319409719
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-40970-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)