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 - researchr publication

researchr

You are not signed in
Sign in
Sign up

Olaf Beyersdorff, Christoph M. Wintersteiger, editors, 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. Volume 10929 of Lecture Notes in Computer Science, Springer, 2018. [doi]

Conference: sat2018

Abstract is missing.

Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended AbstractChristoph Scholl, Ralf Wimmer. 3-16 [doi]

Approximately Propagation Complete and Conflict Propagating Constraint EncodingsRüdiger Ehlers, Francisco Palau Romero. 19-36 [doi]

Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSATTobias Paxian, Sven Reimer, Bernd Becker 0001. 37-53 [doi]

Solving MaxSAT with Bit-Vector OptimizationAlexander Nadel. 54-72 [doi]

Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean SolversJan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals. 75-93 [doi]

Machine Learning-Based Restart Policy for CDCL SAT SolversJia Hui Liang, Chanseok Oh, Minu Mathew, Ciza Thomas, Chunxiao Li, Vijay Ganesh. 94-110 [doi]

Chronological BacktrackingAlexander Nadel, Vadim Ryvchin. 111-121 [doi]

Centrality-Based Improvements to CDCL HeuristicsSima Jamali, David Mitchell. 122-131 [doi]

Fast Sampling of Perfectly Uniform Satisfying AssignmentsDimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos. 135-147 [doi]

Fast and Flexible Probabilistic Model CountingDimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos. 148-164 [doi]

Exploiting Treewidth for Projected Model Counting and Its LimitsJohannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran. 165-184 [doi]

Circuit-Based Search Space Pruning in QBFMikolás Janota. 187-198 [doi]

Symmetries of Quantified Boolean FormulasManuel Kauers, Martina Seidl. 199-216 [doi]

Local Soundness for QBF CalculiMartin Suda 0001, Bernhard Gleiss. 217-234 [doi]

QBF as an Alternative to Courcelle's TheoremMichael Lampis, Stefan Mengel, Valia Mitsou. 235-252 [doi]

Polynomial-Time Validation of QCDCL CertificatesTomás Peitl, Friedrich Slivovsky, Stefan Szeider. 253-269 [doi]

Sharpness of the Satisfiability Threshold for Non-uniform Random k-SATTobias Friedrich 0001, Ralf Rothenberger. 273-291 [doi]

In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT SolvingMarc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström. 292-310 [doi]

Cops-Robber Games and the Resolution of Tseitin FormulasNicola Galesi, Navid Talebanfard, Jacobo Torán. 311-326 [doi]

Minimal Unsatisfiability and Minimal Strongly Connected DigraphsHoda Abbasizanjani, Oliver Kullmann. 329-345 [doi]

Finding All Minimal Safe Inductive SetsRyan Berryhill, Alexander Ivrii, Andreas G. Veneris. 346-362 [doi]

Effective Use of SMT Solvers for Program Equivalence Checking Through Invariant-Sketching and Query-DecompositionShubhani Gupta, Aseem Saxena, Anmol Mahajan, Sorav Bansal. 365-382 [doi]

Experimenting on Solving Nonlinear Integer Arithmetic with Incremental LinearizationAlessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri, Roberto Sebastiani. 383-398 [doi]

XOR-Satisfiability Set Membership FiltersSean A. Weaver, Hannah J. Roberts, Michael J. Smith 0012. 401-418 [doi]

ALIAS: A Modular Tool for Finding Backdoors for SATStepan Kochemazov, Oleg Zaikin. 419-427 [doi]

PySAT: A Python Toolkit for Prototyping with SAT OraclesAlexey Ignatiev, António Morgado, João Marques-Silva. 428-437 [doi]

Constrained Image Generation Using Binarized Neural Networks with Decision ProceduresSvyatoslav Korneev, Nina Narodytska, Luca Pulina, Armando Tacchella, Nikolaj Bjørner, Mooly Sagiv. 438-449 [doi]

runs on WebDSL