|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1725 occurrences of 797 keywords
|
|
|
Results
Found 5713 publication records. Showing 5700 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
29 | Massimo D'Antonio, Giorgio Delzanno |
SAT-Based Analysis of Cellular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACRI ![In: Cellular Automata, 6th International Conference on Cellular Automata for Research and Industry, ACRI 2004, Amsterdam, The Netherlands, October 25-28, 2004, Proceedings, pp. 745-754, 2004, Springer, 3-540-23596-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Cristian Coarfa, Demetrios D. Demopoulos, Alfonso San Miguel Aguirre, Devika Subramanian, Moshe Y. Vardi |
Random 3-SAT: The Plot Thickens. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 8(3), pp. 243-261, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Kenneth L. McMillan |
Methods for exploiting SAT solvers in unbounded model checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MEMOCODE ![In: 1st ACM & IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE 2003), 24-26 June 2003, Mont Saint-Michel, France, Proceedings, pp. 135-, 2003, IEEE Computer Society, 0-7695-1923-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Lintao Zhang, Sharad Malik |
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2003 Design, Automation and Test in Europe Conference and Exposition (DATE 2003), 3-7 March 2003, Munich, Germany, pp. 10880-10885, 2003, IEEE Computer Society, 0-7695-1870-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Ming Shao, Guanghui Li 0001, Xiaowei Li 0001 |
SAT-Based Algorithm of Verification for Port Order Fault. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 12th Asian Test Symposium (ATS 2003), 17-19 November 2003, Xian, China, pp. 478-481, 2003, IEEE Computer Society, 0-7695-1951-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Edmund M. Clarke |
SAT-Based Counterexample Guided Abstraction Refinement in Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings, pp. 1, 2003, Springer, 3-540-40559-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Madhu K. Iyer, Ganapathy Parthasarathy, Kwang-Ting Cheng |
SATORI - A Fast Sequential SAT Engine for Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2003 International Conference on Computer-Aided Design, ICCAD 2003, San Jose, CA, USA, November 9-13, 2003, pp. 320-325, 2003, IEEE Computer Society / ACM, 1-58113-762-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Eduardo Rodriguez-Tello, Jose Torres-Jimenez |
ERA: An Algorithm for Reducing the Epistasis of SAT Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part II, pp. 1283-1294, 2003, Springer, 3-540-40603-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Carlos Ansótegui, Felip Manyà |
New Logical and Complexity Results for Signed-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 16-19 May 2003, Tokyo, Japan, pp. 181-187, 2003, IEEE Computer Society, 0-7695-1918-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Amol Dattatraya Mali, Yevgeny Lipen |
MFSAT: A SAT Solver Using Multi-Flip Local Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 3-5 November 2003, Sacramento, California, USA, pp. 84-93, 2003, IEEE Computer Society, 0-7695-2038-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Samir Sapra, Michael Theobald, Edmund M. Clarke |
SAT-Based Algorithms for Logic Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 21st International Conference on Computer Design (ICCD 2003),VLSI in Computers and Processors, 13-15 October 2003, San Jose, CA, USA, Proceedings, pp. 510-, 2003, IEEE Computer Society, 0-7695-2025-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Daniel G. Saab, Jacob A. Abraham, Vivekananda M. Vedula |
Formal Verification Using Bounded Model Checking: SAT versus Sequential ATPG Engines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 16th International Conference on VLSI Design (VLSI Design 2003), 4-8 January 2003, New Delhi, India, pp. 243-248, 2003, IEEE Computer Society, 0-7695-1868-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Hyeong-Ju Kang, In-Cheol Park |
SAT-based unbounded symbolic model checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 40th Design Automation Conference, DAC 2003, Anaheim, CA, USA, June 2-6, 2003, pp. 840-843, 2003, ACM, 1-58113-688-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
boolean satisfiability checking, unbounded symbolic model checking, formal verification, symbolic model checking |
29 | Anbulagan, John Thornton 0001, Abdul Sattar 0001 |
Dynamic Variable Filtering for Hard Random 3-SAT Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Conference on Artificial Intelligence ![In: AI 2003: Advances in Artificial Intelligence, 16th Australian Conference on Artificial Intelligence, Perth, Australia, December 3-5, 2003, Proceedings, pp. 100-111, 2003, Springer, 3-540-20646-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Search, Constraints, Problem Solving |
29 | Michael Lewin, Dror Livnat, Uri Zwick |
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 67-82, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Teresa Alsinet, Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà |
Minimal and Redundant SAT Encodings for the All-Interval-Series Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCIA ![In: Topics in Artificial Intelligence, 5th Catalonian Conference on AI, CCIA 2002, Castellón, Spain, October 24-25, 2002, Proceedings, pp. 139-144, 2002, Springer, 3-540-00011-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Seda Ogrenci Memik, Farzan Fallah |
Accelerated SAT-based Scheduling of Control/Data Flow Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 20th International Conference on Computer Design (ICCD 2002), VLSI in Computers and Processors, 16-18 September 2002, Freiburg, Germany, Proceedings, pp. 395-, 2002, IEEE Computer Society, 0-7695-1700-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Carlos Ansótegui, Felip Manyà |
Bridging the Gap between SAT and CSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2002, 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings, pp. 784-785, 2002, Springer, 3-540-44120-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Frank Hutter, Dave A. D. Tompkins, Holger H. Hoos |
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2002, 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings, pp. 233-248, 2002, Springer, 3-540-44120-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Alessandro Armando, Luca Compagna |
Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORTE ![In: Formal Techniques for Networked and Distributed Systems - FORTE 2002, 22nd IFIP WG 6.1 International Conference Houston, Texas, USA, November 11-14, 2002, Proceedings, pp. 210-225, 2002, Springer, 3-540-00141-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Verification, Network security |
29 | Pankaj Chauhan, Edmund M. Clarke, James H. Kukula, Samir Sapra, Helmut Veith, Dong Wang |
Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: Formal Methods in Computer-Aided Design, 4th International Conference, FMCAD 2002, Portland, OR, USA, November 6-8, 2002, Proceedings, pp. 33-51, 2002, Springer, 3-540-00116-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Malay K. Ganai, Adnan Aziz |
Improved SAT-Based Bounded Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC/VLSI Design ![In: Proceedings of the 7th Asia and South Pacific Design Automation Conference (ASP-DAC 2002), and the 15th International Conference on VLSI Design (VLSI Design 2002), Bangalore, India, January 7-11, 2002, pp. 729-734, 2002, IEEE Computer Society, 0-7695-1299-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Uwe Schöning |
New Algorithms for k -SAT Based on the Local Search Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 87-95, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Andreas Goerdt, Michael Krivelevich |
Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 294-304, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Alfonso San Miguel Aguirre, Moshe Y. Vardi |
Random 3-SAT and BDDs: The Plot Thickens Further. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2001, 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings, pp. 121-136, 2001, Springer, 3-540-42863-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Kevin Chen, Vijay Ramachandran |
A Space-Efficient Randomized DNA Algorithm for k-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA Computing ![In: DNA Computing, 6th International Workshop on DNA-Based Computers, DNA 2000, Leiden, The Netherlands, June 13-17, 2000, Revised Papers, pp. 199-208, 2000, Springer, 3-540-42076-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Parosh Aziz Abdulla, Per Bjesse, Niklas Eén |
Symbolic Reachability Analysis Based on SAT-Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for Construction and Analysis of Systems, 6th International Conference, TACAS 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings, pp. 411-425, 2000, Springer, 3-540-67282-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Johannes Köbler, Jochen Messner |
Is the Standard Proof System for SAT P-Optimal? ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, Proceedings., pp. 361-372, 2000, Springer, 3-540-41413-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Paul Tafertshofer, Andreas Ganz |
SAT based ATPG using fast justification and propagation in the implication graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design, 1999, San Jose, California, USA, November 7-11, 1999, pp. 139-146, 1999, IEEE Computer Society, 0-7803-5832-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
27 | Daniel Singer, Anthony Monnet |
JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPAM ![In: Parallel Processing and Applied Mathematics, 7th International Conference, PPAM 2007, Gdansk, Poland, September 9-12, 2007, Revised Selected Papers, pp. 249-258, 2007, Springer, 978-3-540-68105-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Ashish Sabharwal |
SymChaff: exploiting symmetry in a structure-aware satisfiability solver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 14(4), pp. 478-505, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
SymChaff, Complete multi-class symmetry, Global symmetry, High-level representation, Planning, SAT, Boolean satisfiability |
27 | Éric Grégoire, Bertrand Mazure, Cédric Piette |
Local-search Extraction of MUSes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 12(3), pp. 325-344, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Minimally unsatisfiable subformulas, Local search, SAT |
27 | Conghua Zhou |
A compositional symbolic verification framework for concurrent software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Infoscale ![In: Proceedings of the 2nf International Conference on Scalable Information Systems, Infoscale 2007, Suzhou, China, June 6-8, 2007, pp. 79, 2007, ACM, 978-1-59593-757-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
model checking, composition, abstract, SAT |
27 | Lucas Bordeaux, Youssef Hamadi, Lintao Zhang |
Propositional Satisfiability and Constraint Programming: A comparative survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Comput. Surv. ![In: ACM Comput. Surv. 38(4), pp. 12, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Search, constraint satisfaction, SAT |
27 | Jerome L. Paul, Michal Kouril, Kenneth A. Berman |
A template library to facilitate teaching message passing parallel computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 37th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2006, Houston, Texas, USA, March 3-5, 2006, pp. 464-468, 2006, ACM, 1-59593-259-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
teaching aid, template library, parallel processing, MPI, SAT, beowulf clusters |
27 | Michal Kouril, Jerome L. Paul |
A parallel backtracking framework (BkFr) for single and multiple clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Conf. Computing Frontiers ![In: Proceedings of the First Conference on Computing Frontiers, 2004, Ischia, Italy, April 14-16, 2004, pp. 302-312, 2004, ACM, 1-58113-741-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
inter-cluster communication, intra-cluster communication, MPI, SAT, backtracking, ICI |
26 | Meena Mahajan, Friedrich Slivovsky (eds.) |
26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0 The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
26 | Jacobo Torán, Florian Wörz |
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 26:1-26:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 0:1-0:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Andrew Haberlandt, Harrison Green, Marijn J. H. Heule |
Effective Auxiliary Variables via Structured Reencoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 11:1-11:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | George Katsirelos |
An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 12:1-12:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Dror Fried, Alexander Nadel, Yogev Shalmon |
AllSAT for Combinational Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 9:1-9:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Albert Oliveras, Chunxiao Li 0002, Darryl Wu, Jonathan Chung 0003, Vijay Ganesh |
Learning Shorter Redundant Clauses in SDCL Using MaxSAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 18:1-18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Benjamin Böhm 0001, Olaf Beyersdorff |
QCDCL vs QBF Resolution: Further Insights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 4:1-4:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Pedro Orvalho, Vasco M. Manquinho, Ruben Martins |
UpMax: User Partitioning for MaxSAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 19:1-19:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Irfansha Shaik, Maximilian Heisinger, Martina Seidl, Jaco van de Pol |
Validation of QBF Encodings with Winning Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 24:1-24:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Florian Pollitt, Mathias Fleury, Armin Biere |
Faster LRAT Checking Than Solving with CaDiCaL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 21:1-21:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Randal E. Bryant, Wojciech Nawrocki, Jeremy Avigad, Marijn J. H. Heule |
Certified Knowledge Compilation with Application to Verified Model Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 6:1-6:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Long-Hin Fung, Tony Tan |
On the Complexity of k-DQBF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 10:1-10:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Ilario Bonacina, Maria Luisa Bonet, Jordi Levy |
Polynomial Calculus for MaxSAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 5:1-5:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Tereza Schwarzová, Jan Strejcek, Juraj Major |
Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 23:1-23:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere |
IPASIR-UP: User Propagators for CDCL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 8:1-8:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Junping Zhou, Jiaxin Liang, Minghao Yin, Bo He |
LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 29:1-29:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Armin Biere, Nils Froleyks, Wenxi Wang |
CadiBack: Extracting Backbones with CaDiCaL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 3:1-3:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Marc Vinyals, Chunxiao Li 0002, Noah Fleming, Antonina Kolokolova, Vijay Ganesh |
Limits of CDCL Learning via Merge Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 27:1-27:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Adrián Rebola-Pardo |
Even Shorter Proofs Without New Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 22:1-22:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Andreas Plank, Martina Seidl |
QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 20:1-20:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Stefan Mengel |
Bounds on BDD-Based Bucket Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 16:1-16:11, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann |
Proof Complexity of Propositional Model Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 2:1-2:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Alexis de Colnet |
Separating Incremental and Non-Incremental Bottom-Up Compilation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, pp. 7:1-7:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-286-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Kuldeep S. Meel, Ofer Strichman (eds.) |
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6 The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
26 | Dmitry Itsykson, Artur Riazanov, Petr Smirnov |
Tight Bounds for Tseitin Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 6:1-6:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Jean Christoph Jung, Valentin Mayer-Eichberger, Abdallah Saffidine |
QBF Programming with the Modeling Language Bule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 31:1-31:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Friedrich Slivovsky |
Quantified CDCL with Universal Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 24:1-24:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Meena Mahajan, Gaurav Sood 0001 |
QBF Merge Resolution Is Powerful but Unnatural. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 22:1-22:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Bernardo Subercaseaux, Marijn J. H. Heule |
The Packing Chromatic Number of the Infinite Square Grid Is at Least 14. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 21:1-21:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Benjamin Böhm 0001, Tomás Peitl, Olaf Beyersdorff |
Should Decisions in QCDCL Follow Prefix Order? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 11:1-11:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Stefan Mengel |
Changing Partitions in Rectangle Decision Lists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 17:1-17:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Agnes Schleitzer, Olaf Beyersdorff |
Classes of Hard Formulas for QBF Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 5:1-5:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Pavel Smirnov 0003, Jeremias Berg, Matti Järvisalo |
Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 13:1-13:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Nina Narodytska, Nikolaj S. Bjørner |
Analysis of Core-Guided MaxSat Using Cores and Correction Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 26:1-26:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Franz-Xaver Reichl, Friedrich Slivovsky |
Pedant: A Certifying DQBF Solver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 20:1-20:10, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Leroy Chew, Marijn J. H. Heule |
Relating Existing Powerful Proof Systems for QBF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 10:1-10:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Johannes Klaus Fichte, Markus Hecher, Valentin Roland |
Proofs for Propositional Model Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 30:1-30:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Christoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Järvisalo |
MaxSAT-Based Bi-Objective Boolean Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 12:1-12:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Hao-Ren Wang, Kuan-Hua Tu, Jie-Hong Roland Jiang, Christoph Scholl 0001 |
Quantifier Elimination in Stochastic Boolean Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 23:1-23:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider |
Weighted Model Counting with Twin-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 15:1-15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Josep Alos, Carlos Ansótegui, Josep M. Salvia, Eduard Torres |
OptiLog V2: Model, Solve, Tune and Run. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 25:1-25:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel |
Certified CNF Translations for Pseudo-Boolean Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 16:1-16:25, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Milan Mossé, Harry Sha, Li-Yang Tan |
A Generalization of the Satisfiability Coding Lemma and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 9:1-9:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Andreas Niskanen, Jeremias Berg, Matti Järvisalo |
Incremental Maximum Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 14:1-14:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 0:1-0:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Max Bannach, Malte Skambath, Till Tantau |
On the Parallel Parameterized Complexity of MaxSAT Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 19:1-19:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Mikolás Janota, Jelle Piepenbrock, Bartosz Piotrowski |
Towards Learning Quantifier Instantiation in SMT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 7:1-7:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Armin Biere, Md. Solimul Chowdhury, Marijn J. H. Heule, Benjamin Kiesl, Michael W. Whalen |
Migrating Solver State. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 27:1-27:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Chu-Min Li, Felip Manyà (eds.) |
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![Springer, 978-3-030-80222-6 The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Miki Hermann, Gernot Salzer |
MCP: Capturing Big Data by Satisfiability (Tool Description). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 207-215, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Makai Mann, Amalee Wilson, Yoni Zohar, Lindsey Stuntz, Ahmed Irfan, Kristopher Brown, Caleb Donovick, Allison Guman, Cesare Tinelli, Clark W. Barrett |
Smt-Switch: A Solver-Agnostic C++ API for SMT Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 377-386, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Martin Mariusz Lester |
Scheduling Reach Mahjong Tournaments Using Pseudoboolean Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 349-358, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Benjamin Böhm 0001, Olaf Beyersdorff |
Lower Bounds for QCDCL via Formula Gauge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 47-63, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Zhendong Lei, Shaowei Cai 0001, Chuan Luo 0002, Holger H. Hoos |
Efficient Local Search for Pseudo Boolean Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 332-348, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Marijn J. H. Heule |
Chinese Remainder Encoding for Hamiltonian Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 216-224, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Daniel Le Berre, Romain Wallon |
On Dedicated CDCL Strategies for PB Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 315-331, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Stefan Mengel, Friedrich Slivovsky |
Proof Complexity of Symbolic QBF Reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 399-416, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Mathias Fleury, Armin Biere |
Efficient All-UIP Learned Clause Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 171-187, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney |
PyDGGA: Distributed GGA for Automatic Configuration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 11-20, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Paulius Dilkas, Vaishak Belle |
Weighted Model Counting Without Parameter Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 134-151, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Oliver Kullmann, Oleg Zaikin 0002 |
Projection Heuristics for Binary Branchings Between Sum and Product. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 299-314, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi |
ProCount: Weighted Projected Model Counting with Graded Project-Join Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 152-170, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Alexis de Colnet, Stefan Mengel |
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, pp. 116-133, 2021, Springer, 978-3-030-80222-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
|
|