×

zbMATH — the first resource for mathematics

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. (English) Zbl 1390.68015
Lecture Notes in Computer Science 10929. Cham: Springer (ISBN 978-3-319-94143-1/pbk; 978-3-319-94144-8/ebook). xix, 452 p. (2018).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1368.68008].
Indexed articles:
Ehlers, Rüdiger; Palau Romero, Francisco, Approximately propagation complete and conflict propagating constraint encodings, 19-36 [Zbl 06916297]
Paxian, Tobias; Reimer, Sven; Becker, Bernd, Dynamic polynomial watchdog encoding for solving weighted maxsat, 37-53 [Zbl 06916298]
Nadel, Alexander, Solving MaxSAT with bit-vector optimization, 54-72 [Zbl 06916299]
Elffers, Jan; Giráldez-Cru, Jesús; Nordström, Jakob; Vinyals, Marc, Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers, 75-93 [Zbl 06916300]
Liang, Jia Hui; Oh, Chanseok; Mathew, Minu; Thomas, Ciza; Li, Chunxiao; Ganesh, Vijay, Machine learning-based restart policy for CDCL SAT solvers, 94-110 [Zbl 06916301]
Nadel, Alexander; Ryvchin, Vadim, Chronological backtracking, 111-121 [Zbl 1442.68219]
Jamali, Sima; Mitchell, David, Centrality-based improvements to CDCL heuristics, 122-131 [Zbl 06916303]
Achlioptas, Dimitris; Hammoudeh, Zayd S.; Theodoropoulos, Panos, Fast sampling of perfectly uniform satisfying assignments, 135-147 [Zbl 06916304]
Achlioptas, Dimitris; Hammoudeh, Zayd; Theodoropoulos, Panos, Fast and flexible probabilistic model counting, 148-164 [Zbl 06916305]
Fichte, Johannes K.; Hecher, Markus; Morak, Michael; Woltran, Stefan, Exploiting treewidth for projected model counting and its limits, 165-184 [Zbl 06916306]
Janota, Mikoláš, Circuit-based search space pruning in QBF, 187-198 [Zbl 06916307]
Kauers, Manuel; Seidl, Martina, Symmetries of quantified Boolean formulas, 199-216 [Zbl 06916308]
Suda, Martin; Gleiss, Bernhard, Local soundness for QBF calculi, 217-234 [Zbl 06916309]
Lampis, Michael; Mengel, Stefan; Mitsou, Valia, QBF as an alternative to Courcelle’s theorem, 235-252 [Zbl 06916310]
Peitl, Tomáš; Slivovsky, Friedrich; Szeider, Stefan, Polynomial-time validation of QCDCL certificates, 253-269 [Zbl 06916311]
Friedrich, Tobias; Rothenberger, Ralf, Sharpness of the satisfiability threshold for non-uniform random \(k\)-SAT, 273-291 [Zbl 06916312]
Vinyals, Marc; Elffers, Jan; Giráldez-Cru, Jesús; Gocht, Stephan; Nordström, Jakob, In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving, 292-310 [Zbl 06916313]
Galesi, Nicola; Talebanfard, Navid; Torán, Jacobo, Cops-robber games and the resolution of Tseitin formulas, 311-326 [Zbl 06916314]
Abbasizanjani, Hoda; Kullmann, Oliver, Minimal unsatisfiability and minimal strongly connected digraphs, 329-345 [Zbl 06916315]
Berryhill, Ryan; Ivrii, Alexander; Veneris, Andreas, Finding all minimal safe inductive sets, 346-362 [Zbl 06916316]
Gupta, Shubhani; Saxena, Aseem; Mahajan, Anmol; Bansal, Sorav, Effective use of SMT solvers for program equivalence checking through invariant-sketching and query-decomposition, 365-382 [Zbl 06916317]
Cimatti, Alessandro; Griggio, Alberto; Irfan, Ahmed; Roveri, Marco; Sebastiani, Roberto, Experimenting on solving nonlinear integer arithmetic with incremental linearization, 383-398 [Zbl 06916318]
Weaver, Sean A.; Roberts, Hannah J.; Smith, Michael J., XOR-satisfiability set membership filters, 401-418 [Zbl 06916319]
Kochemazov, Stepan; Zaikin, Oleg, ALIAS: a modular tool for finding backdoors for SAT, 419-427 [Zbl 06916320]
Ignatiev, Alexey; Morgado, Antonio; Marques-Silva, Joao, PySAT: A Python toolkit for prototyping with SAT oracles, 428-437 [Zbl 06916321]
Korneev, Svyatoslav; Narodytska, Nina; Pulina, Luca; Tacchella, Armando; Bjorner, Nikolaj; Sagiv, Mooly, Constrained image generation using binarized neural networks with decision procedures, 438-449 [Zbl 06916322]

MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Q25 Analysis of algorithms and problem complexity
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX XML Cite
Full Text: DOI