default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSMT/PoS@CP/SAT/SoCS 2025: Glasgow, UK
- Jochen Hoenicke, Mikolás Janota, Aina Niemetz, Sophie Tourret:
Joint Proceedings of the 23rd International Workshop on Satisfiability Modulo Theories and the 16th Pragmatics of SAT International Workshop co-located with the 31st International Conference on Principles and Practice of Constraint Programming, the 28th International Conference on Theory and Applications of Satisfiability Testing and the 18th International Symposium on Combinatorial Search (CP 2025 & SAT 2025 & SoCS 2025), Glasgow, UK, August 10-11, 2025. CEUR Workshop Proceedings 4008, CEUR-WS.org 2025
Invited Talks Abstracts
- Jan Strejcek:
Deciding Satisfiability of Quantified Bitvector Formulae with BDDs. 1 - Katalin Fazekas:
SAT Reasoning in CDCL(T) Solvers. 2
Original Papers
- Jacob M. Howe, Martin Brain, Arnau Gàmez-Montolio:
Evaluating Binary Polynomials using Subpolynomials. 3-15 - Antton Kasslin, Jeremias Berg:
An Optimization Modulo Theories-Based Approach to Cumulative Scheduling with Delays. 16-28 - Nestan Tsiskaridze, Andrew Reynolds, Cesare Tinelli, Clark W. Barrett:
A Proposal for an OMT Extension to SMT-LIB. 29-44
Extended Abstracts
- Jan Jakubuv, Mikolás Janota:
Quantifier Instantiations: To Mimic or To Revolt. 45-51 - Marek Danco, Petra Hozzová, Mikolás Janota:
From MBQI to Enumerative Instantiation and Back. 52-58 - Ellen Dasnois, Pascal Fontaine:
A Few Exercises on the Complexity of Congruence Closure with Cardinality Constraints. 59-64 - Hichem Rami Ait El Hara, Guillaume Bury, Basile Clément, Pierre Villemot:
Constraint Propagation for Bit-Vectors in Alt-Ergo. 65-76 - Guy Frankel, Rudi Schneider, Michel Steuwer, Elizabeth Polgreen:
Syntax-Guided Synthesis with Counterexample-Guided E-graphs: A Work-in-Progress Report. 77-90 - Soaibuzzaman, Jan Oliver Ringert:
On Writing SMT-LIB Scripts: Metrics and a New Dataset. 91-102 - Marcel Barlik, Martin Brain:
Comparative Analysis of SMT Solvers for Differential Cryptanalysis of SHA-2. 103-125 - Christophe Junke, François Bobot:
Visualization of Execution Traces in Colibri 2 SMT Solver. 126-135 - Can Cebeci, Nikolaj Bjørner, George Candea, Clément Pit-Claudel:
A Conjecture Regarding SMT Instability. 136-147 - Amar Shah, Yi Zhou, Marijn Heule, Bryan Parno:
Instability Track for SMT-COMP. 148-152
Original Papers
- Florian Pollitt, Mathias Fleury, Armin Biere, Karem A. Sakallah, Marijn Heule, Jiawei Chen, Yonathan Fisseha:
Revisiting Clause Vivification. 153-167 - James Madgwick, Martin Mariusz Lester:
SAT-Web: A Web-Based Educational SAT Visualisation Tool. 168-176 - Mia Müßig, Jan Johannsen:
Improving Watched Pseudo-Boolean Propagation with Significant Literals. 177-189 - Katalin Fazekas, Florian Pollitt, Mathias Fleury, Armin Biere:
Incremental Inprocessing Rules beyond Resolution. 190-200
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-06-21 22:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
