Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
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.).
| 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.). |
| Creatore | [SAT (Conference) (16th : 2013 : Helsinki, Finland)] |
| Estensione | 1 online resource (xvi, 436 pages) : illustrations (black and white). |
| Disciplina | 005.1 |
| Accesso persona |
Järvisalo, Matti, editor
Van Gelder, Allen, editor |
| Genere/Forma |
Congresses
Electronic books Conference papers and proceedings |
| 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 |
| ISBN |
9783642390715
3642390714 9783642390708 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | NYU-004420387 |
[SAT (Conference) (16th : 2013 : Helsinki, Finland)]
|
|
| Materiale a stampa | |
| Lo trovi qui: New York University | |
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.).
| 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.). |
| Creatore | [SAT (Conference) (16th : 2013 : Helsinki, Finland)] |
| Estensione | 1 online resource (xvi, 436 pages) : illustrations (black and white). |
| Disciplina | 005.1 |
| Accesso persona |
Järvisalo, Matti, editor
Van Gelder, Allen, editor |
| Genere/Forma |
Electronic books
Conference papers and proceedings Ebook Congresses |
| 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 |
| ISBN |
9783642390715
3642390714 9783642390708 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | NYU-004655512 |
|
[SAT (Conference) (16th : 2013 : Helsinki, Finland)]
|
|
| Materiale a stampa | |
| Lo trovi qui: New York University | |
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.).
| 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.). |
| Creatore | [SAT (Conference) (16th : 2013 : Helsinki, Finland)] |
| Estensione | 1 online resource (xvi, 436 pages) : illustrations (black and white). |
| Accesso persona |
Järvisalo, Matti, editor
Van Gelder, Allen, editor |
| Genere/Forma |
Electronic books
Conference papers and proceedings Ebook Congresses |
| 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 |
| ISBN |
9783642390715
3642390714 9783642390708 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | UCHICAGO-11079576 |
|
[SAT (Conference) (16th : 2013 : Helsinki, Finland)]
|
|
| Materiale a stampa | |
| Lo trovi qui: University of Chicago | |
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.).
| 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.). |
| Creatore | [SAT (Conference) (16th : 2013 : Helsinki, Finland)] |
| Estensione | 1 online resource (xvi, 436 pages) : illustrations (black and white). |
| Disciplina | 005.1 |
| Accesso persona |
Järvisalo, Matti, editor
Van Gelder, Allen, editor |
| 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 |
| ISBN |
9783642390715
3642390714 9783642390708 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | STANFORD-a10191200 |
|
[SAT (Conference) (16th : 2013 : Helsinki, Finland)]
|
|
| Materiale a stampa | |
| Lo trovi qui: Stanford University | |