LEADER 03429nam  2200685Ia 450 
001 9910455344403321
005 20200520144314.0
010   $a1-4416-1678-0
010   $a1-60750-376-X
010   $a600-00-1439-2
035   $a(CKB)1000000000765302
035   $a(EBL)448770
035   $a(OCoLC)491253312
035   $a(SSID)ssj0000338455
035   $a(PQKBManifestationID)11254932
035   $a(PQKBTitleCode)TC0000338455
035   $a(PQKBWorkID)10295806
035   $a(PQKB)10382127
035   $a(MiAaPQ)EBC448770
035   $a(Au-PeEL)EBL448770
035   $a(CaPaEBR)ebr10309230
035   $a(CaONFJC)MIL577647
035   $a(OCoLC)935268045
035   $a(EXLCZ)991000000000765302
100   $a20081220d2009      uy             0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 00$aHandbook of satisfiability$b[electronic resource] /$fedited by Armin Biere ... [et al.]
210   $aAmsterdam, The Netherlands ;$aWashington, DC $cIOS Press$dc2009
215   $a1 online resource (980 p.)
225 1 $aFrontiers in artificial intelligence and applications,$x0922-6389 ;$vv. 185
300   $aDescription based upon print version of record.
311   $a1-58603-929-6 
320   $aIncludes bibliographical references and indexes.
327   $aTitle page; Contents; Part I. Theory and Algorithms; Chapter 1. A History of Satisfiability; Chapter 2. CNF Encodings; Chapter 3. Complete Algorithms; Chapter 4. CDCL Solvers; Chapter 5. Look-Ahead Based SAT Solvers; Chapter 6. Incomplete Algorithms; Chapter 7. Fundaments of Branching Heuristics; Chapter 8. Random Satisfiability; Chapter 9. Exploiting Runtime Variation in Complete Solvers; Chapter 10. Symmetry and Satisfiability; Chapter 11. Minimal Unsatisfiability and Autarkies; Chapter 12. Worst-Case Upper Bounds; Chapter 13. Fixed-Parameter Tractability
327   $aPart II. Applications and ExtensionsChapter 14. Bounded Model Checking; Chapter 15. Planning and SAT; Chapter 16. Software Verification; Chapter 17. Combinatorial Designs by SAT Solvers; Chapter 18. Connections to Statistical Physics; Chapter 19. MaxSAT; Chapter 20. Model Counting; Chapter 21. Non-Clausal SAT and ATPG; Chapter 22. Pseudo-Boolean and Cardinality Constraints; Chapter 23. QBF Theory; Chapter 24. QBFs reasoning; Chapter 25. SAT Techniques for Modal and Description Logics; Chapter 26. Satisfiability Modulo Theories; Chapter 27. Stochastic Boolean Satisfiability; Subject Index
327   $aCited Author IndexContributing Authors and Affiliations
330   $aA collection of papers on various theoretical and practical aspects of SAT solving. It is suitable for students and researchers.
410  0$aFrontiers in artificial intelligence and applications ;$vv. 185.
606   $aPropositional calculus$vCongresses
606   $aDecision making$vCongresses
606   $aComputer algorithms$vCongresses
606   $aAlgebra, Boolean$vCongresses
608   $aElectronic books.
615  0$aPropositional calculus
615  0$aDecision making
615  0$aComputer algorithms
615  0$aAlgebra, Boolean
676   $a006.3
701   $aBiere$b Armin$0985334
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910455344403321
996   $aHandbook of satisfiability$92252075
997   $aUNINA

LEADER 01141nam a2200313 i 4500
001 991003684729707536
005 20021220115303.0
008 020610s1987    uk             ||| |eng| 
020   $a0521339464
035   $ab11847876-39ule_inst
035   $aLE01313309$9ExL
040   $aDip.to Matematica$beng
082 0 $a514.26
084   $aAMS 55-06
084   $aAMS 57P
111 2 $aLms Durham Symposium$d<1985>$0531820
245 10$aHomotopy theory :$bproceedings of the Durham Symposium 1985 /$cedited by E. Rees, J. D. S. Jones
260   $aCambridge ; New York :$bCambridge University Press,$c1987
300   $a247 p. ;$c23 cm
490 0 $aLondon Mathematical Society lecture note series,$x0076-0552 ;$v117
650  0$aHomotopy theory$xCongresses
700 1 $aRees, Elmer G.
700 1 $aJones, J. D. S.
907   $a.b11847876$b28-04-17$c20-12-02
912   $a991003684729707536
945   $aLE013 55-XX REE11 (1987)$g1$i2013000132037$lle013$o-$pE0.00$q-$rl$s-  $t0$u0$v0$w0$x0$y.i12100298$z20-12-02
996   $aHomotopy theory$9899801
997   $aUNISALENTO
998   $ale013$b01-01-02$cm$da  $e-$feng$gxx $h0$i1