Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st SAT 2018: Oxford, UK
- Olaf Beyersdorff, Christoph M. Wintersteiger
:
Theory and Applications of Satisfiability Testing - SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings. Lecture Notes in Computer Science 10929, Springer 2018, ISBN 978-3-319-94143-1
Invited Talk
- Christoph Scholl, Ralf Wimmer:
Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended Abstract. 3-16
Maximum Satisfiability
- Rüdiger Ehlers, Francisco Palau Romero:
Approximately Propagation Complete and Conflict Propagating Constraint Encodings. 19-36 - Tobias Paxian, Sven Reimer, Bernd Becker:
Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT. 37-53 - Alexander Nadel:
Solving MaxSAT with Bit-Vector Optimization. 54-72
Conflict Driven Clause Learning
- Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals:
Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. 75-93 - Jia Hui Liang, Chanseok Oh, Minu Mathew, Ciza Thomas, Chunxiao Li, Vijay Ganesh:
Machine Learning-Based Restart Policy for CDCL SAT Solvers. 94-110 - Alexander Nadel, Vadim Ryvchin:
Chronological Backtracking. 111-121 - Sima Jamali, David Mitchell:
Centrality-Based Improvements to CDCL Heuristics. 122-131
Model Counting
- Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos:
Fast Sampling of Perfectly Uniform Satisfying Assignments. 135-147 - Dimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos:
Fast and Flexible Probabilistic Model Counting. 148-164 - Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Exploiting Treewidth for Projected Model Counting and Its Limits. 165-184
Quantified Boolean Formulae
- Mikolás Janota:
Circuit-Based Search Space Pruning in QBF. 187-198 - Manuel Kauers, Martina Seidl:
Symmetries of Quantified Boolean Formulas. 199-216 - Martin Suda, Bernhard Gleiss:
Local Soundness for QBF Calculi. 217-234 - Michael Lampis, Stefan Mengel, Valia Mitsou:
QBF as an Alternative to Courcelle's Theorem. 235-252 - Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Polynomial-Time Validation of QCDCL Certificates. 253-269
Theory
- Tobias Friedrich, Ralf Rothenberger:
Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. 273-291 - Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström:
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. 292-310 - Nicola Galesi, Navid Talebanfard, Jacobo Torán:
Cops-Robber Games and the Resolution of Tseitin Formulas. 311-326
Minimally Unsatisfiable Sets
- Hoda Abbasizanjani, Oliver Kullmann:
Minimal Unsatisfiability and Minimal Strongly Connected Digraphs. 329-345 - Ryan Berryhill, Alexander Ivrii, Andreas G. Veneris:
Finding All Minimal Safe Inductive Sets. 346-362
Satisfiability Modulo Theories
- Shubhani Gupta, Aseem Saxena, Anmol Mahajan, Sorav Bansal:
Effective Use of SMT Solvers for Program Equivalence Checking Through Invariant-Sketching and Query-Decomposition. 365-382 - Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri, Roberto Sebastiani:
Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization. 383-398
Tools and Applications
- Sean A. Weaver, Hannah J. Roberts, Michael J. Smith:
XOR-Satisfiability Set Membership Filters. 401-418 - Stepan Kochemazov, Oleg Zaikin:
ALIAS: A Modular Tool for Finding Backdoors for SAT. 419-427 - Alexey Ignatiev, António Morgado, João Marques-Silva:
PySAT: A Python Toolkit for Prototyping with SAT Oracles. 428-437 - Svyatoslav Korneev, Nina Narodytska, Luca Pulina, Armando Tacchella, Nikolaj S. Bjørner, Mooly Sagiv:
Constrained Image Generation Using Binarized Neural Networks with Decision Procedures. 438-449
a service of 
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 2024-06-29 00:47 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:
