Theory and applications of satisfiability testing - SAT 2009 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg [u.a.]
Springer
2009
|
| Schriftenreihe: | Lecture Notes in Computer Science
5584 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035636985 | ||
| 003 | DE-604 | ||
| 005 | 20090805 | ||
| 007 | t | ||
| 008 | 090720s2009 d||| |||| 10||| eng d | ||
| 015 | |a 09,N26,0075 |2 dnb | ||
| 016 | 7 | |a 994680260 |2 DE-101 | |
| 020 | |a 9783642027765 |c PB. : EUR 73.78 (freier Pr.), sfr 107.00 (freier Pr.) |9 978-3-642-02776-5 | ||
| 020 | |a 3642027768 |9 3-642-02776-8 | ||
| 024 | 3 | |a 9783642027765 | |
| 035 | |a (OCoLC)419645707 | ||
| 035 | |a (DE-599)DNB994680260 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-706 |a DE-11 |a DE-83 | ||
| 050 | 0 | |a QA9.3 | |
| 082 | 0 | |a 005.1015113 |2 22/ger | |
| 084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
| 084 | |a DAT 540f |2 stub | ||
| 084 | |a DAT 517f |2 stub | ||
| 084 | |a DAT 706f |2 stub | ||
| 084 | |a MAT 030f |2 stub | ||
| 084 | |a 004 |2 sdnb | ||
| 245 | 1 | 0 | |a Theory and applications of satisfiability testing - SAT 2009 |b 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009 ; proceedings |c Oliver Kullmann (ed.) |
| 264 | 1 | |a Berlin ; Heidelberg [u.a.] |b Springer |c 2009 | |
| 300 | |a XII, 540 S. |b graph. Darst. |c 235 mm x 155 mm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture Notes in Computer Science |v 5584 | |
| 650 | 4 | |a Constraint-Programmierung - Kongress - Swansea <2009> | |
| 650 | 4 | |a Erfüllbarkeitsproblem - Boolesche Formel - Kongress - Swansea <2009> | |
| 650 | 4 | |a Erfüllbarkeitsproblem - Kongress - Swansea <2009> | |
| 650 | 4 | |a Algebra, Boolean |v Congresses | |
| 650 | 4 | |a Computer algorithms |v Congresses | |
| 650 | 4 | |a Decision making |v Congresses | |
| 650 | 4 | |a Propositional calculus |v Congresses | |
| 650 | 0 | 7 | |a Boolesche Formel |0 (DE-588)4328877-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Constraint-Programmierung |0 (DE-588)4567206-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Erfüllbarkeitsproblem |0 (DE-588)4323820-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2009 |z Swansea |2 gnd-content | |
| 689 | 0 | 0 | |a Erfüllbarkeitsproblem |0 (DE-588)4323820-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Erfüllbarkeitsproblem |0 (DE-588)4323820-8 |D s |
| 689 | 1 | 1 | |a Boolesche Formel |0 (DE-588)4328877-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Constraint-Programmierung |0 (DE-588)4567206-4 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Kullmann, Oliver |d 1965- |e Sonstige |0 (DE-588)120426285 |4 oth | |
| 711 | 2 | |a SAT |n 12 |d 2009 |c Swansea |j Sonstige |0 (DE-588)16013928-4 |4 oth | |
| 830 | 0 | |a Lecture Notes in Computer Science |v 5584 |w (DE-604)BV000000607 |9 5584 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017691831&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017691831 | ||
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0102/DAT 001z 2001 A 999-5584 |
|---|---|
| DE-BY-TUM_katkey | 1700448 |
| DE-BY-TUM_media_number | 040010154742 |
| _version_ | 1816712975862464512 |
| adam_text | IMAGE 1
TABLE OF CONTENTS
1. INVITED TALKS SAT MODULO THEORIES: ENHANCING SAT WITH SPECIAL-PURPOSE
ALGORITHMS 1
ROBERT NIEUWENHUIS
SYMBOLIC TECHNIQUES IN PREPOSITIONAL SATISFIABILITY SOLVING 2 MOSHE Y.
VARDI
2. APPLICATIONS OF SAT
EFFICIENTLY CALCULATING EVOLUTIONARY TREE MEASURES USING SAT 4 MARIA
LUISA BONET AND KATHERINE ST. JOHN
FINDING LEAN INDUCED CYCLES IN BINARY HYPERCUBES 18
YURY CHEBIRYAK, THOMAS WAHL, DANIEL KROENING. AND LEOPOLD HALLER
FINDING EFFICIENT CIRCUITS USING SAT-SOLVERS 32
ARIST KOJEVNIKOV, ALEXANDER S. KULIKOV. AND GRIGORY YAROSLAVTSEV
ENCODING TREEWIDTH INTO SAT 45
MARKO SANIER AND HELMUT VEITH
3. COMPLEXITY THEORY
THE COMPLEXITY OF REASONING FOR FRAGMENTS OF DEFAULT LOGIC 51 OLAF
BEYERSDORFF, ARNE MEIER, MICHAEL THOMAS, AND HERIBERT VOLLMER
DOES ADVICE HELP TO PROVE PROPOSITIONAL TAUTOLOGIES? 65
OLAF BEYERSDORFF AND SEBASTIAN MUELLER
4. STRUCTURES FOR SAT
BACKDOORS IN THE CONTEXT OF LEARNING 73
BISTRA DILKINA, CARIA P. GOMES, AND ASHISH SABHARWAL
SOLVING SAT FOR CNF FORMULAS WITH A ONE-SIDED RESTRICTION ON VARIABLE
OCCURRENCES 80
DANIEL JOHANNSEN, IGOR RAZGON, AND MAGNUS WAHLSTROERN
ON SOME ASPECTS OF MIXED HORN FORMULAS 86
STEFAN PORSCHEN, TATJANA SCHMIDT, AND EWALD SPECKENMEYER
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/994680260
DIGITALISIERT DURCH
IMAGE 2
X TABLE OF CONTENTS
VARIABLE INFLUENCES IN CONJUNCTIVE NORMAL FORMS 101
PATRICK TRAXLER
5. RESOLUTION AND SAT
CLAUSE-LEARNING ALGORITHMS WITH MANY RESTARTS AND BOUNDED-WIDTH
RESOLUTION 114
ALBERT ATSERIAS. JOHANNES KLAUS FICHTE, AND MARC THURLEY
AN EXPONENTIAL LOWER BOUND FOR WIDTH-RESTRICTED CLAUSE LEARNING... . 128
JAN JOHANNSEN
IMPROVED CONFLICT-CLAUSE MINIMIZATION LEADS TO IMPROVED PROPORTIONAL
PROOF TRACES 141
ALLEN VAN GELDER
BOUNDARY POINTS AND RESOLUTION 147
EUGENE GOLDBERG
6. TRANSLATIONS TO CNF
SEQUENTIAL ENCODINGS FROM MAX-CSP INTO PARTIAL MAX-SAT 161 JOSEP
ARGELICH, ALBA CABISCOL. INES LYNCE, AND FELIP MANYA
CARDINALITY NETWORKS AND THEIR APPLICATIONS 167
ROBERTO A SIN. ROBERT NIEUWENHUIS, ALBERT OLIVERAS, AND ENRIC
RODRIGUEZ-CARBONE.IL
NEW ENCODINGS OF PSEUDO- BOOLEAN CONSTRAINTS INTO CNF 181
OLIVIER BAILLEUR, YACINE BOUFKHAD, AND OLIVIER ROUSSEL
EFFICIENT TERM-ITE CONVERSION FOR SATISFIABILITY MODULO THEORIES 195
HYONDE.UK KIM, FABIO SOMENZI, AND HOONSANG JIN
7. TECHNIQUES FOR CONFLICT-DRIVEN SAT SOLVERS
ON-THE-FLV CLAUSE IMPROVEMENT 209
HYOJUNG HAN AND FABIO SOMENZI
DYNAMIC SYMMETRY BREAKING BY SIMULATING ZYKOV CONTRACTION 223 BAS
SCHAAFSMA. MARIJN J.H. HEULE, AND HANS VAN MAAREN
MINIMIZING LEARNED CLAUSES 237
NIKLAS SOERENSSON AND ARMIN BIERE
EXTENDING SAT SOLVERS TO CRYPTOGRAPHIC PROBLEMS 244
MATE SOOS, KARSTEN NOHL, AND CLAUDE CASTELLUCCIA
IMAGE 3
TABLE OF CONTENTS XI
8. SOLVING SAT BY LOCAL SEARCH
IMPROVING VARIABLE SELECTION PROCESS IN STOCHASTIC LOCAL SEARCH FOR
PROPOSITIONAL SATISFIABILITY 258
ANTON BELOV AND ZBIGNIEW STACHNIAK
A THEORETICAL ANALYSIS OF SEARCH IN GSAT 265
EVGENY S. SKVORTSOV
THE PARAMETERIZED COMPLEXITY OF FC-FLIP LOCAL SEARCH FOR SAT AND MAX SAT
276
STEFAN SZEIDER
9. HYBRID SAT SOLVERS
A NOVEL APPROACH TO COMBINE A SLS- AND A DPLL-SOLVER FOR THE
SATISFIABILITY PROBLEM 284
ADRIAN BALINT, MICHAEL HENN, AND OLIVER GABLESKE
BUILDING A HYBRID SAT SOLVER VIA CONFLICT-DRIVEN, LOOK-AHEAD AND XOR
REASONING TECHNIQUES 298
JINGCHAO CHEN
10. AUTOMATIC ADAPTION OF SAT SOLVERS
RESTART STRATEGY SELECTION USING MACHINE LEARNING TECHNIQUES 312 SHAI
HAIM AND TOBY WALSH
INSTANCE-BASED SELECTION OF POLICIES FOR SAT SOLVERS 326
MLADEN NIKOLIC, FILIP MARIE, AND PREDRAG JANICIC
WIDTH-BASED RESTART POLICIES FOR CLAUSE-LEARNING SATISFIABILITY SOLVERS
341
KNOT PIPATSRISAWAT AND ADRIAN DARWICHE
PROBLEM-SENSITIVE RESTART HEURISTICS FOR THE DPLL PROCEDURE 356 CARSTEN
SINZ AND MARKUS ISER
11. STOCHASTIC APPROACHES TO SAT SOLVING
(1,2)-QSAT: A GOOD CANDIDATE FOR UNDERSTANDING PHASE TRANSITIONS
MECHANISMS 363
NADIA CREIGNOU, HERVE DAUDE, UWE EGLY, AND RAPHAEL ROSSIGNOL
VARSAT: INTEGRATING NOVEL PROBABILISTIC INFERENCE TECHNIQUES WITH DPLL
SEARCH 377
ERIC I. HSU AND SHEILA A. MCRRAITH
IMAGE 4
XII TABLE OF CONTENTS
12. QBFS AND THEIR REPRESENTATIONS
RESOLUTION AND EXPRESSIVENESS OF SUBCLASSES OF QUANTIFIED BOOLEAN
FORMULAS AND CIRCUITS 391
HANS KLEINE BUENING, XISHUN ZHAO, AND UWE BUBECK
A COMPACT REPRESENTATION FOR SYNTACTIC DEPENDENCIES IN QBFS 398 FLORIAN
LONSING AND ARMIN BIERE
BEYOND CNF: A CIRCUIT-BASED QBF SOLVER 412
ALEXANDRA GOULTIAEVA, VICKI IVERSON, AND FAHIEM BACCHUS
13. OPTIMISATION ALGORITHMS
SOLVING (WEIGHTED) PARTIAL MAXSAT THROUGH SATISFIABILITY TESTING 427
CARLOS ANSOTEGUI, MARIA LUISA BONET, AND JORDI LEVY
NONLINEAR PSEUDO-BOOLEAN OPTIMIZATION: RELAXATION OR PROPAGATION? .. .
441 TIMO BERTHOLD, STEFAN HEINZ, AND MARC E. PFETSCH
RELAXED DPLL SEARCH FOR MAXSAT 447
LUKAS KROC, ASHISH SABHARWAL, AND BART SELMAN
BRANCH AND BOUND FOR BOOLEAN OPTIMIZATION AND THE GENERATION OF
OPTIMALITY CERTIFICATES 453
JAVIER LARROSA, ROBERT NIEUWENHUIS, ALBERT OLIVERAS, AND ENRIC
RODRIGUEZ-CARBONELL
EXPLOITING CYCLE STRUCTURES IN MAX-SAT 467
CHU MIN LI, FELIP MANYA, NOUREDINE MOHAMEDOU, AND JORDI PLANES
GENERALIZING CORE-GUIDED MAX-SAT 481
MARK H. LIFFITON AND KAREM A. SAKALLAH
ALGORITHMS FOR WEIGHTED BOOLEAN OPTIMIZATION 495
VASCO MANQUINHO, JOAO MARQUES-SILVA, AND JORDI PLANES
14. DISTRIBUTED AND PARALLEL SOLVING
PAQUBE: DISTRIBUTED QBF SOLVING WITH ADVANCED KNOWLEDGE SHARING 509
MATTHEW LEWIS, PAOLO MARIN, TOBIAS SCHUBERT, MASSIMO NARIZZANO, BERND
BECKER, AND ENRICO GIUNCHIGLIA
C-SAT: A PARALLEL SAT SOLVER FOR CLUSTERS 524
KEI OHMURA AND KAZUNORI UEDA
AUTHOR INDEX 539
|
| any_adam_object | 1 |
| author_GND | (DE-588)120426285 |
| building | Verbundindex |
| bvnumber | BV035636985 |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.3 |
| callnumber-search | QA9.3 |
| callnumber-sort | QA 19.3 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 4800 |
| classification_tum | DAT 540f DAT 517f DAT 706f MAT 030f |
| ctrlnum | (OCoLC)419645707 (DE-599)DNB994680260 |
| dewey-full | 005.1015113 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1015113 |
| dewey-search | 005.1015113 |
| dewey-sort | 15.1015113 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02830nam a2200661 cb4500</leader><controlfield tag="001">BV035636985</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090805 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090720s2009 d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">09,N26,0075</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">994680260</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642027765</subfield><subfield code="c">PB. : EUR 73.78 (freier Pr.), sfr 107.00 (freier Pr.)</subfield><subfield code="9">978-3-642-02776-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642027768</subfield><subfield code="9">3-642-02776-8</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642027765</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)419645707</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB994680260</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.3</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1015113</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4800</subfield><subfield code="0">(DE-625)143528:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 540f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 030f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Theory and applications of satisfiability testing - SAT 2009</subfield><subfield code="b">12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009 ; proceedings</subfield><subfield code="c">Oliver Kullmann (ed.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 540 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">235 mm x 155 mm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture Notes in Computer Science</subfield><subfield code="v">5584</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint-Programmierung - Kongress - Swansea <2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Erfüllbarkeitsproblem - Boolesche Formel - Kongress - Swansea <2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Erfüllbarkeitsproblem - Kongress - Swansea <2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra, Boolean</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decision making</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Propositional calculus</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Boolesche Formel</subfield><subfield code="0">(DE-588)4328877-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Constraint-Programmierung</subfield><subfield code="0">(DE-588)4567206-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2009</subfield><subfield code="z">Swansea</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Boolesche Formel</subfield><subfield code="0">(DE-588)4328877-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Constraint-Programmierung</subfield><subfield code="0">(DE-588)4567206-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kullmann, Oliver</subfield><subfield code="d">1965-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)120426285</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">SAT</subfield><subfield code="n">12</subfield><subfield code="d">2009</subfield><subfield code="c">Swansea</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16013928-4</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture Notes in Computer Science</subfield><subfield code="v">5584</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">5584</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017691831&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017691831</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2009 Swansea gnd-content |
| genre_facet | Konferenzschrift 2009 Swansea |
| id | DE-604.BV035636985 |
| illustrated | Illustrated |
| indexdate | 2024-11-25T17:26:05Z |
| institution | BVB |
| institution_GND | (DE-588)16013928-4 |
| isbn | 9783642027765 3642027768 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017691831 |
| oclc_num | 419645707 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-706 DE-11 DE-83 |
| owner_facet | DE-91G DE-BY-TUM DE-706 DE-11 DE-83 |
| physical | XII, 540 S. graph. Darst. 235 mm x 155 mm |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Springer |
| record_format | marc |
| series | Lecture Notes in Computer Science |
| series2 | Lecture Notes in Computer Science |
| spellingShingle | Theory and applications of satisfiability testing - SAT 2009 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009 ; proceedings Lecture Notes in Computer Science Constraint-Programmierung - Kongress - Swansea <2009> Erfüllbarkeitsproblem - Boolesche Formel - Kongress - Swansea <2009> Erfüllbarkeitsproblem - Kongress - Swansea <2009> Algebra, Boolean Congresses Computer algorithms Congresses Decision making Congresses Propositional calculus Congresses Boolesche Formel (DE-588)4328877-7 gnd Constraint-Programmierung (DE-588)4567206-4 gnd Erfüllbarkeitsproblem (DE-588)4323820-8 gnd |
| subject_GND | (DE-588)4328877-7 (DE-588)4567206-4 (DE-588)4323820-8 (DE-588)1071861417 |
| title | Theory and applications of satisfiability testing - SAT 2009 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009 ; proceedings |
| title_auth | Theory and applications of satisfiability testing - SAT 2009 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009 ; proceedings |
| title_exact_search | Theory and applications of satisfiability testing - SAT 2009 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009 ; proceedings |
| title_full | Theory and applications of satisfiability testing - SAT 2009 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009 ; proceedings Oliver Kullmann (ed.) |
| title_fullStr | Theory and applications of satisfiability testing - SAT 2009 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009 ; proceedings Oliver Kullmann (ed.) |
| title_full_unstemmed | Theory and applications of satisfiability testing - SAT 2009 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009 ; proceedings Oliver Kullmann (ed.) |
| title_short | Theory and applications of satisfiability testing - SAT 2009 |
| title_sort | theory and applications of satisfiability testing sat 2009 12th international conference sat 2009 swansea uk june 30 july 3 2009 proceedings |
| title_sub | 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009 ; proceedings |
| topic | Constraint-Programmierung - Kongress - Swansea <2009> Erfüllbarkeitsproblem - Boolesche Formel - Kongress - Swansea <2009> Erfüllbarkeitsproblem - Kongress - Swansea <2009> Algebra, Boolean Congresses Computer algorithms Congresses Decision making Congresses Propositional calculus Congresses Boolesche Formel (DE-588)4328877-7 gnd Constraint-Programmierung (DE-588)4567206-4 gnd Erfüllbarkeitsproblem (DE-588)4323820-8 gnd |
| topic_facet | Constraint-Programmierung - Kongress - Swansea <2009> Erfüllbarkeitsproblem - Boolesche Formel - Kongress - Swansea <2009> Erfüllbarkeitsproblem - Kongress - Swansea <2009> Algebra, Boolean Congresses Computer algorithms Congresses Decision making Congresses Propositional calculus Congresses Boolesche Formel Constraint-Programmierung Erfüllbarkeitsproblem Konferenzschrift 2009 Swansea |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017691831&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT kullmannoliver theoryandapplicationsofsatisfiabilitytestingsat200912thinternationalconferencesat2009swanseaukjune30july32009proceedings AT satswansea theoryandapplicationsofsatisfiabilitytestingsat200912thinternationalconferencesat2009swanseaukjune30july32009proceedings |