Theory and applications of satisfiability testing - SAT 2010: 13th international conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 ; proceedings
Gespeichert in:
Format: | Tagungsbericht Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2010
|
Schriftenreihe: | Lecture notes in computer science
6175 |
Schlagworte: | |
Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
Beschreibung: | Literaturangaben |
Beschreibung: | XIII, 400 S. graph. Darst. |
ISBN: | 3642141854 9783642141850 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV036602008 | ||
003 | DE-604 | ||
005 | 20100827 | ||
007 | t| | ||
008 | 100805s2010 xx d||| |||| 10||| eng d | ||
015 | |a 10N23 |2 dnb | ||
016 | 7 | |a 1003136575 |2 DE-101 | |
020 | |a 3642141854 |c PB. : EUR 66.34 (freier Pr.), sfr 96.50 (freier Pr.) |9 3-642-14185-4 | ||
020 | |a 9783642141850 |c PB. : EUR 66.34 (freier Pr.), sfr 96.50 (freier Pr.) |9 978-3-642-14185-0 | ||
035 | |a (OCoLC)658322214 | ||
035 | |a (DE-599)DNB1003136575 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-706 |a DE-91G |a DE-83 | ||
082 | 0 | |a 005.1015113 |2 22/ger | |
084 | |a 004 |2 sdnb | ||
084 | |a DAT 540f |2 stub | ||
084 | |a DAT 517f |2 stub | ||
245 | 1 | 0 | |a Theory and applications of satisfiability testing - SAT 2010 |b 13th international conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 ; proceedings |c Ofer Strichman ... (eds.) |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2010 | |
300 | |a XIII, 400 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 6175 | |
500 | |a Literaturangaben | ||
650 | 0 | 7 | |a Erfüllbarkeitsproblem |0 (DE-588)4323820-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Boolesche Formel |0 (DE-588)4328877-7 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2010 |z Edinburgh |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 | |
700 | 1 | |a Strichman, Ofer |e Sonstige |4 oth | |
711 | 2 | |a SAT |n 13 |d 2010 |c Edinburgh |j Sonstige |0 (DE-588)16073182-3 |4 oth | |
830 | 0 | |a Lecture notes in computer science |v 6175 |w (DE-604)BV000000607 |9 6175 | |
856 | 4 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3487311&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext | |
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=020522488&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-020522488 |
Datensatz im Suchindex
_version_ | 1820875251537412096 |
---|---|
adam_text |
TABLE OF CONTENTS PART 1. INVITED TALKS THE BIG DEAL: APPLYING
CONSTRAINT SATISFACTION TECHNOLOGIES WHERE IT MAKES THE DIFFERENCE 1
YEHUDA NAVEH EXACT ALGORITHMS AND COMPLEXITY 8 RAMAMOHAN PATURI PART 2.
REGULAR PAPERS IMPROVING STOCHASTIC LOCAL SEARCH FOR SAT WITH A NEW
PROBABILITY DISTRIBUTION 10 ADRIAN BALINT AND ANDREAS FROEHLICH LOWER
BOUNDS FOR WIDTH-RESTRICTED CLAUSE LEARNING ON SMALL WIDTH FORMULAS 16
ELI BEN-SASSON AND JAN JOHANNSEN PROOF COMPLEXITY OF PROPOSITIONAL
DEFAULT LOGIC 30 OLAF BEYERSDORFF, ARNE MEIER, SEBASTIAN MUELLER, MICHAEL
THOMAS, AND HERIBERT VOLLMER AUTOMATED TESTING AND DEBUGGING OF SAT AND
QBF SOLVERS 44 ROBERT BRUMMAYER, FLORIAN LONSING, AND ARMIN BIERE
REWRITING (DEPENDENCY-)QUANTIFIED 2-CNF WITH ARBITRARY FREE LITERALS
INTO EXISTENTIAL 2-HORN 58 UWE BUBECK AND HANS KLEINE BUENING
SYNTHESIZING SHORTEST LINEAR STRAIGHT-LINE PROGRAMS OVER GF(2) USING SAT
71 CARSTEN FUHS AND PETER SCHNEIDER-KAMP SQUEEZEBF: AN EFFECTIVE
PREPROCESSOR FOR QBFS BASED ON EQUIVALENCE REASONING 85 ENRICO
GIUNCHIGLIA, PAOLO MARIN, AND MASSIMO NARIZZANO NON UNIFORM SELECTION OF
SOLUTIONS FOR UPPER BOUNDING THE 3-SAT THRESHOLD 99 YACINE BOUFLCHAD AND
THOMAS HUGEL SYMMETR BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/1003136575 DIGITALISIERT DURCH XII TABLE OF CONTENTS A
NON-PRENEX, NON-CLAUSAL QBF SOLVER WITH GAME-STATE LEARNING 128 WILLIAM
KLIEBER, SAMIR SAPRA, SICUN GAO, AND EDMUND CLARKE SAT SOLVING WITH
REFERENCE POINTS 143 STEPHAN KOTTIER INTEGRATING DEPENDENCY SCHEMES IN
SEARCH-BASED QBF SOLVERS 158 FLORIAN LONSING AND ARMIN BIERE AN EXACT
ALGORITHM FOR THE BOOLEAN CONNECTIVITY PROBLEM FOR K-CNF 172 KAZUHISA
MAKINO, SUGURU TAMAKI, AND MASAKI YAMAMOTO IMPROVING
UNSATISFIABILITY-BASED ALGORITHMS FOR BOOLEAN OPTIMIZATION 181 VASCO
MANQUINHO, RUBEN MARTINS, AND INES LYNCE ENCODING TECHNIQUES, CRAIG
INTERPOLANTS AND BOUNDED MODEL CHECKING FOR INCOMPLETE DESIGNS 194
CHRISTIAN MILLER, STEFAN KUPFERSCHMID, MATTHEW LEWIS, AND BERND BECKER
STATISTICAL METHODOLOGY FOR COMPARISON OF SAT SOLVERS 209 MLADEN NIKOLIC
ON THE RELATIVE MERITS OF SIMPLE LOCAL SEARCH METHODS FOR THE MAX-SAT
PROBLEM 223 DENIS PANKRATOV AND ALLAN BORODIN THE SEVENTH QBF SOLVERS
EVALUATION (QBFEVAL'10) 237 CLAUDIA PESCHIERA, LUCA PULINA, ARMANDO
TACCHELLA, UWE BUBECK, OLIVER KULLMANN, AND INES LYNCE COMPLEXITY
RESULTS FOR LINEAR XSAT-PROBLEMS 251 STEFAN PORSCHEN, TATJANA SCHMIDT,
AND EWALD SPECKENMEYER BOUNDS ON THRESHOLD OF REGULAR RANDOM K-SAT 26
TABLE OF CONTENTS XIII A SYSTEM FOR SOLVING CONSTRAINT SATISFACTION
PROBLEMS WITH SMT 300 MIQUEL BOFILL, JOSEP SUY, AND MATEU VILLARET TWO
TECHNIQUES FOR MINIMIZING RESOLUTION PROOFS 306 SCOTT COTTON ON
MODERATELY EXPONENTIAL TIME FOR SAT 313 EVGENY DANTSIN AND ALEXANDER
WOLPERT MINIMISING DETERMINISTIC BUECHI AUTOMATA PRECISELY USING SAT
SOLVING 326 RUEDIGER EHLERS EXPLOITING CIRCUIT REPRESENTATIONS IN QBF
SOLVING 333 ALEXANDRA GOULTIAEVA AND FAHIEM BACCHUS RECONSTRUCTING
SOLUTIONS AFTER BLOCKED CLAUSE ELIMINATION 340 MATTI JAERVISALO AND ARMIN
BIERE AN EMPIRICAL STUDY OF OPTIMAL NOISE AND RUNTIME DISTRIBUTIONS IN
LOCAL SEARCH 346 LUKAS KROC, ASHISH SABHARWAL, AND BART SELMAN GREEN-TAO
NUMBERS AND SAT 352 OLIVER KULLMANN EXACT MINSAT SOLVING 363 CHU MIN LI,
FELIP MANYA, ZHE QUAN, AND ZHU ZHU UNIQUELY SATISFIABLE FC-SAT INSTANCES
WITH ALMOST MINIMAL OCCURRENCES OF EACH VARIABLE 369 WILLIAM MATTHEWS
AND RAMAMOHAN PATURI ASSIGNMENT STACK SHRINKING 375 ALEXANDER NADEL AND
VADIM RYVCHIN SIMPLE BUT HARD MIXED HORN FORMULAS 382 GAYATHRI
NAMASIVAYAM AND MIROSLAW TRUSZCZYNSKI ZERO-ONE DESIGNS PRODUCE SMALL
HARD SAT INSTANCES 388 ALLEN |
any_adam_object | 1 |
building | Verbundindex |
bvnumber | BV036602008 |
classification_rvk | SS 4800 |
classification_tum | DAT 540f DAT 517f |
ctrlnum | (OCoLC)658322214 (DE-599)DNB1003136575 |
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 |
format | Conference Proceeding Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV036602008</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100827</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">100805s2010 xx d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">10N23</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1003136575</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642141854</subfield><subfield code="c">PB. : EUR 66.34 (freier Pr.), sfr 96.50 (freier Pr.)</subfield><subfield code="9">3-642-14185-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642141850</subfield><subfield code="c">PB. : EUR 66.34 (freier Pr.), sfr 96.50 (freier Pr.)</subfield><subfield code="9">978-3-642-14185-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)658322214</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1003136575</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</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">004</subfield><subfield code="2">sdnb</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="245" ind1="1" ind2="0"><subfield code="a">Theory and applications of satisfiability testing - SAT 2010</subfield><subfield code="b">13th international conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 ; proceedings</subfield><subfield code="c">Ofer Strichman ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 400 S.</subfield><subfield code="b">graph. Darst.</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">6175</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</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="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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2010</subfield><subfield code="z">Edinburgh</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="700" ind1="1" ind2=" "><subfield code="a">Strichman, Ofer</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">SAT</subfield><subfield code="n">13</subfield><subfield code="d">2010</subfield><subfield code="c">Edinburgh</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16073182-3</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">6175</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">6175</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3487311&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</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=020522488&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020522488</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 2010 Edinburgh gnd-content |
genre_facet | Konferenzschrift 2010 Edinburgh |
id | DE-604.BV036602008 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:12:38Z |
institution | BVB |
institution_GND | (DE-588)16073182-3 |
isbn | 3642141854 9783642141850 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020522488 |
oclc_num | 658322214 |
open_access_boolean | |
owner | DE-706 DE-91G DE-BY-TUM DE-83 |
owner_facet | DE-706 DE-91G DE-BY-TUM DE-83 |
physical | XIII, 400 S. graph. Darst. |
publishDate | 2010 |
publishDateSearch | 2010 |
publishDateSort | 2010 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Theory and applications of satisfiability testing - SAT 2010 13th international conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 ; proceedings Ofer Strichman ... (eds.) Berlin [u.a.] Springer 2010 XIII, 400 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 6175 Literaturangaben Erfüllbarkeitsproblem (DE-588)4323820-8 gnd rswk-swf Boolesche Formel (DE-588)4328877-7 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2010 Edinburgh gnd-content Erfüllbarkeitsproblem (DE-588)4323820-8 s DE-604 Boolesche Formel (DE-588)4328877-7 s Strichman, Ofer Sonstige oth SAT 13 2010 Edinburgh Sonstige (DE-588)16073182-3 oth Lecture notes in computer science 6175 (DE-604)BV000000607 6175 text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3487311&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020522488&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Theory and applications of satisfiability testing - SAT 2010 13th international conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 ; proceedings Lecture notes in computer science Erfüllbarkeitsproblem (DE-588)4323820-8 gnd Boolesche Formel (DE-588)4328877-7 gnd |
subject_GND | (DE-588)4323820-8 (DE-588)4328877-7 (DE-588)1071861417 |
title | Theory and applications of satisfiability testing - SAT 2010 13th international conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 ; proceedings |
title_auth | Theory and applications of satisfiability testing - SAT 2010 13th international conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 ; proceedings |
title_exact_search | Theory and applications of satisfiability testing - SAT 2010 13th international conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 ; proceedings |
title_full | Theory and applications of satisfiability testing - SAT 2010 13th international conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 ; proceedings Ofer Strichman ... (eds.) |
title_fullStr | Theory and applications of satisfiability testing - SAT 2010 13th international conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 ; proceedings Ofer Strichman ... (eds.) |
title_full_unstemmed | Theory and applications of satisfiability testing - SAT 2010 13th international conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 ; proceedings Ofer Strichman ... (eds.) |
title_short | Theory and applications of satisfiability testing - SAT 2010 |
title_sort | theory and applications of satisfiability testing sat 2010 13th international conference sat 2010 edinburgh uk july 11 14 2010 proceedings |
title_sub | 13th international conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 ; proceedings |
topic | Erfüllbarkeitsproblem (DE-588)4323820-8 gnd Boolesche Formel (DE-588)4328877-7 gnd |
topic_facet | Erfüllbarkeitsproblem Boolesche Formel Konferenzschrift 2010 Edinburgh |
url | http://deposit.dnb.de/cgi-bin/dokserv?id=3487311&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020522488&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT strichmanofer theoryandapplicationsofsatisfiabilitytestingsat201013thinternationalconferencesat2010edinburghukjuly11142010proceedings AT satedinburgh theoryandapplicationsofsatisfiabilitytestingsat201013thinternationalconferencesat2010edinburghukjuly11142010proceedings |