Vai al contenuto principale della pagina

Theory and applications of satisfiability testing-- SAT 2013 : 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings / Matti Järvisalo, Allen Van Gelder (eds.).



(Visualizza formato Marc21)    (visualizza in BIBRAME 2.0)

Creatore: SAT (Conference) (16th : 2013 : Helsinki, Finland)
Titolo: Theory and applications of satisfiability testing-- SAT 2013 : 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings / Matti Järvisalo, Allen Van Gelder (eds.).
Link to work: Theory and applications of satisfiability testing-- SAT 2013 Visualizza cluster
Pubblicazione: Heidelberg : Springer, [2013]
Estensione: 1 online resource (xvi, 436 pages) : illustrations (black and white).
Tipo formato: computer
Tipo contenuto: text
Tipo supporto: online resource
Disciplina: 005.1
Titolo uniforme di collana: Lecture notes in computer science ; 7962.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Genere/Forma: Congresses
Electronic books
Conference papers and proceedings
Index term-Uncontrolled: Computer science
Computer software
Logic design
Artificial intelligence
Logics and Meanings of Programs
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Information and Communication, Circuits
Soggetto non controllato: Computer science
Computer software
Logic design
Artificial intelligence
Logics and Meanings of Programs
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Information and Communication, Circuits
Termine d'indicizzazione-Occupazione: Computer science
Computer software
Logic design
Artificial intelligence
Logics and Meanings of Programs
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Information and Communication, Circuits
Classificazione LOC: QA76.9.A43 S28 2013eb
Creatori/Collaboratori: Järvisalo, Matti, [editor.]
Van Gelder, Allen, [editor.]
Note generali: International conference proceedings.
Includes author index.
Nota di contenuto: Invited Talks. The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs / Albert Atserias -- Turing's Computable Real Numbers and Why They Are Still Important Today / Edmund M. Clarke -- There Are No CNF Problems / Peter J. Stuckey -- Best Paper. Soundness of Inprocessing in Clause Sharing SAT Solvers / Norbert Manthey, Tobias Philipp, Christoph Wernhard -- Technical Papers. Propositional Proof Complexity I. Exponential Separations in a Hierarchy of Clause Learning Proof Systems / Jan Johannsen -- On the Resolution Complexity of Graph Non-isomorphism / Jacobo Torán -- Quantified Boolean Formulas. On Propositional QBF Expansions and Q-Resolution / Mikoláš Janota, Joao Marques-Silva -- Recovering and Utilizing Partial Duality in QBF / Alexandra Goultiaeva, Fahiem Bacchus -- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation / Florian Lonsing, Uwe Egly, Allen Van Gelder.
Parallel Solving. Concurrent Clause Strengthening / Siert Wieringa, Keijo Heljanko -- Parallel MUS Extraction / Anton Belov, Norbert Manthey, Joao Marques-Silva -- Maximum Satisfiability. A Modular Approach to MaxSAT Modulo Theories / Alessandro Cimatti [and others] -- Exploiting the Power of mip Solvers in maxsat / Jessica Davies, Fahiem Bacchus -- Community-Based Partitioning for MaxSAT Solving / Ruben Martins, Vasco Manquinho, Inês Lynce -- Encodings and Applications. Experiments with Reduction Finding / Charles Jordan, Łukasz Kaiser -- A Constraint Satisfaction Approach for Programmable Logic Detailed Placement / Andrew Mihal, Steve Teig -- Minimizing Models for Tseitin-Encoded SAT Instances / Markus Iser, Carsten Sinz, Mana Taghdiri.
Beyond SAT. Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability / Marcelo Finger [and others] -- Quantified Maximum Satisfiability: / Alexey Ignatiev, Mikoláš Janota, Joao Marques-Silva -- Nested Boolean Functions as Models for Quantified Boolean Formulas / Uwe Bubeck, Hans Kleine Büning -- Solver Techniques and Algorithms. Factoring Out Assumptions to Speed Up MUS Extraction / Jean-Marie Lagniez, Armin Biere -- On the Interpolation between Product-Based Message Passing Heuristics for SAT / Oliver Gableske -- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction / Gilles Audemard, Jean-Marie Lagniez, Laurent Simon -- Clique-Width and SAT. A SAT Approach to Clique-Width / Marijn J.H. Heule, Stefan Szeider -- Cliquewidth and Knowledge Compilation / Igor Razgon, Justyna Petke.
Propositional Proof Complexity II. A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem / Massimo Lauria -- The Complexity of Theorem Proving in Autoepistemic Logic / Olaf Beyersdorff -- Parameterized Complexity. Local Backbones / Ronald de Haan, Iyad Kanj, Stefan Szeider -- Upper and Lower Bounds for Weak Backdoor Set Detection / Neeldhara Misra [and others] -- Tool Papers. LearnSAT: A SAT Solver for Education / Mordechai (Moti) Ben-Ari -- MUStICCa: MUS Extraction with Interactive Choice of Candidates / Johannes Dellert, Christian Zielke, Michael Kaufmann -- SCSat: A Soft Constraint Guided SAT Solver / Hiroshi Fujita, Miyuki Koshimura, Ryuzo Hasegawa -- Snappy: A Simple Algorithm Portfolio / Horst Samulowitz, Chandra Reddy, Ashish Sabharwal, Meinolf Sellmann -- Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems / Takehide Soh, Naoyuki Tamura, Mutsunori Banbara.
Restrizioni accesso: Access is restricted to users affiliated with licensed institutions.
Sommario/riassunto: This book constitutes the refereed proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testing, SAT 2013, held in Helsinki, Finland in July 2013. The 21 regular papers, 5 short papers, and 5 tool papers presented together with 3 invited talks were carefully reviewed and selected from 71 submissions (50 regular, 15 short and 6 tool papers). The focus of the papers in on following topics: maximum satifiability, encodings and applications, solver techniques and algorithms, clique-width and SAT, propositional proof complexity, parameterized complexity.
Collana: Lecture notes in computer science, 0302-9743 ; 7962
LNCS sublibrary, SL 1, Theoretical computer science and general issues
Varianti del titolo: SAT 2013
ISBN: 9783642390715
3642390714
9783642390708
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 004420387
Localizzazioni e accesso elettronico http://link.springer.com/10.1007/978-3-642-39071-5
Collocazione: Electronic access
Lo trovi qui: New York University
Altra ed. diverso supporto: Print version: SAT (Conference) (16th : 2013 : Helsinki, Finland). Theory and Applications of Satisfiability Testing - SAT 2013. Heidelberg : Springer, [2013] 9783642390708 (OCoLC)857108717