|
|
|
|
| LEADER |
02847nam a22006135i 4500 |
| 001 |
978-3-642-21581-0 |
| 003 |
DE-He213 |
| 005 |
20170107112040.0 |
| 007 |
cr nn 008mamaa |
| 008 |
110610s2011 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642215810
|9 978-3-642-21581-0
|
| 024 |
7 |
|
|a 10.1007/978-3-642-21581-0
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.L63
|
| 050 |
|
4 |
|a QA76.5913
|
| 050 |
|
4 |
|a QA76.63
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a UYF
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 072 |
|
7 |
|a COM036000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1015113
|2 23
|
| 245 |
1 |
0 |
|a Theory and Applications of Satisfiability Testing - SAT 2011
|h [electronic resource] :
|b 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings /
|c edited by Karem A. Sakallah, Laurent Simon.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2011.
|
| 300 |
|
|
|a XIII, 371 p. 63 illus., 28 illus. in color.
|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 Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 6695
|
| 520 |
|
|
|a This book constitutes the refereed proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011, held in Ann Arbor, MI, USA in June 2011. The 25 revised full papers presented together with abstracts of 2 invited talks and 10 poster papers were carefully reviewed and selected from 57 submissions. The papers are organized in topical sections on complexity analysis, binary decision diagrams, theoretical analysis, extraction of minimal unsatisfiable subsets, SAT algorithms, quantified Boolean formulae, model enumeration and local search, and empirical evaluation.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Logic design.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 650 |
2 |
4 |
|a Logic Design.
|
| 700 |
1 |
|
|a Sakallah, Karem A.
|e editor.
|
| 700 |
1 |
|
|a Simon, Laurent.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642215803
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 6695
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-21581-0
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
