Abstract is missing.
- Decision levels are stable: towards better SAT heuristicsRobert Nieuwenhuis, Adrià Lozano, Albert Oliveras, Enric Rodríguez-Carbonell. 1-11 [doi]
- Parameter Synthesis for Probabilistic HyperpropertiesErika Ábrahám, Ezio Bartocci, Borzoo Bonakdarpour, Oyendrila Dobe. 12-31 [doi]
- Finding Small Proofs for Description Logic Entailments: Theory and PracticeChristian Alrabbaa, Franz Baader, Stefan Borgwardt, Patrick Koopmann, Alisa Kovtunova. 32-67 [doi]
- A typed parallel lambda-calculus via 1-depth intermediate proofsFederico Aschieri, Agata Ciabattoni, Francesco Antonio Genco. 68-89 [doi]
- Learning What Others KnowAlexandru Baltag, Sonja Smets. 90-119 [doi]
- Rotation Based MSS/MCS EnumerationJaroslav Bendík, Ivana Cerna. 120-137 [doi]
- Tactic Learning and Proving for the Coq Proof AssistantLasse Blaauwbroek, Josef Urban, Herman Geuvers. 138-150 [doi]
- Learning Data Structure Shapes from Memory GraphsJan H. Boockmann, Gerald Lüttgen. 151-168 [doi]
- Induction Models on NA. Dileep, Kuldeep S. Meel, Ammar F. Sabili. 169-190 [doi]
- Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hardMnacho Echenim, Radu Iosif, Nicolas Peltier. 191-211 [doi]
- A Verified SAT Solver Framework including Optimization and Partial ValuationsMathias Fleury, Christoph Weidenbach. 212-229 [doi]
- Deep Reinforcement Learning for Synthesizing Functions in Higher-Order LogicThibault Gauthier. 230-248 [doi]
- NACRE - A Nogood And Clause Reasoning EngineGael Glorian, Jean-Marie Lagniez, Christophe Lecoutre. 249-259 [doi]
- Minimal Modifications of Deep Neural Networks using VerificationBen Goldberger, Guy Katz, Yossi Adi, Joseph Keshet. 260-278 [doi]
- Polynomial Loops: Beyond TerminationMarcel Hark, Florian Frohn, Jürgen Giesl. 279-297 [doi]
- Antiprenexing for WSkS: A Little Goes a Long WayVojtech Havlena, Lukás Holík, Ondrej Lengál, Ondrej Vales, Tomás Vojnar. 298-316 [doi]
- An ASP-based Approach for Boolean Networks Representation and Attractor DetectionTarek Khaled, Belaid Benhamou. 317-333 [doi]
- The Triguarded Fragment with TransitivityEmanuel Kieronski, Adam Malinowski. 334-353 [doi]
- A compositional semantics for Repairable Fault Trees with general distributionsRaúl E. Monti, Carlos E. Budde, Pedro R. D'Argenio. 354-372 [doi]
- Coloring Unit-Distance Strips using SATPeter Oostema, Ruben Martins, Marijn Heule. 373-389 [doi]
- Beyond Symbolic Heaps: Deciding Separation Logic With Inductive DefinitionsJens Katelaan, Florian Zuleger. 390-408 [doi]
- Stateful Premise Selection by Recurrent Neural NetworksBartosz Piotrowski, Josef Urban. 409-422 [doi]
- RAT EliminationAdrián Rebola-Pardo, Georg Weissenbacher. 423-448 [doi]
- On Reasoning about Access to KnowledgeYakoub Salhi. 449-464 [doi]
- Finding Periodic Apartments via Boolean Satisfiability and Orderly GenerationJarkko Savela, Emilia Oikarinen, Matti Järvisalo. 465-482 [doi]
- Sensitivity Analysis of Locked CircuitsJoseph Sweeney, Marijn Heule, Lawrence T. Pileggi. 483-497 [doi]
- A Mechanised Semantics for HOL with Ad-hoc OverloadingJohannes Åman Pohjola, Arve Gengelbach. 498-515 [doi]
- Models of Concurrent Kleene AlgebraAlexandra Silva. 516 [doi]