![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
23rd LPAR 2020: Alicante, Spain
- Elvira Albert, Laura Kovács:
LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Alicante, Spain, May 22-27, 2020. EPiC Series in Computing 73, EasyChair 2020 - Robert Nieuwenhuis
, Adrià Lozano, Albert Oliveras
, Enric Rodríguez-Carbonell
:
Decision levels are stable: towards better SAT heuristics. 1-11 - Erika Ábrahám
, Ezio Bartocci
, Borzoo Bonakdarpour, Oyendrila Dobe
:
Parameter Synthesis for Probabilistic Hyperproperties. 12-31 - Christian Alrabbaa, Franz Baader
, Stefan Borgwardt, Patrick Koopmann
, Alisa Kovtunova
:
Finding Small Proofs for Description Logic Entailments: Theory and Practice. 32-67 - Federico Aschieri, Agata Ciabattoni
, Francesco Antonio Genco:
A typed parallel lambda-calculus via 1-depth intermediate proofs. 68-89 - Alexandru Baltag, Sonja Smets
:
Learning What Others Know. 90-119 - Jaroslav Bendík, Ivana Cerna
:
Rotation Based MSS/MCS Enumeration. 120-137 - Lasse Blaauwbroek, Josef Urban, Herman Geuvers:
Tactic Learning and Proving for the Coq Proof Assistant. 138-150 - Jan H. Boockmann
, Gerald Lüttgen:
Learning Data Structure Shapes from Memory Graphs. 151-168 - A. Dileep, Kuldeep S. Meel, Ammar Fathin Sabili:
Induction Models on N. 169-190 - Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard. 191-211 - Mathias Fleury, Christoph Weidenbach:
A Verified SAT Solver Framework including Optimization and Partial Valuations. 212-229 - Thibault Gauthier
:
Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic. 230-248 - Gael Glorian
, Jean-Marie Lagniez, Christophe Lecoutre:
NACRE - A Nogood And Clause Reasoning Engine. 249-259 - Ben Goldberger, Guy Katz, Yossi Adi, Joseph Keshet:
Minimal Modifications of Deep Neural Networks using Verification. 260-278 - Marcel Hark
, Florian Frohn
, Jürgen Giesl:
Polynomial Loops: Beyond Termination. 279-297 - Vojtech Havlena, Lukás Holík, Ondrej Lengál
, Ondrej Vales, Tomás Vojnar:
Antiprenexing for WSkS: A Little Goes a Long Way. 298-316 - Tarek Khaled, Belaid Benhamou:
An ASP-based Approach for Boolean Networks Representation and Attractor Detection. 317-333 - Emanuel Kieronski
, Adam Malinowski:
The Triguarded Fragment with Transitivity. 334-353 - Raúl E. Monti, Carlos E. Budde
, Pedro R. D'Argenio
:
A compositional semantics for Repairable Fault Trees with general distributions. 354-372 - Peter Oostema, Ruben Martins, Marijn Heule
:
Coloring Unit-Distance Strips using SAT. 373-389 - Jens Katelaan, Florian Zuleger
:
Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions. 390-408 - Bartosz Piotrowski, Josef Urban:
Stateful Premise Selection by Recurrent Neural Networks. 409-422 - Adrián Rebola-Pardo, Georg Weissenbacher
:
RAT Elimination. 423-448 - Yakoub Salhi
:
On Reasoning about Access to Knowledge. 449-464 - Jarkko Savela, Emilia Oikarinen
, Matti Järvisalo:
Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation. 465-482 - Joseph Sweeney, Marijn Heule
, Lawrence T. Pileggi:
Sensitivity Analysis of Locked Circuits. 483-497 - Johannes Åman Pohjola
, Arve Gengelbach:
A Mechanised Semantics for HOL with Ad-hoc Overloading. 498-515 - Alexandra Silva:
Models of Concurrent Kleene Algebra. 516
![](https://dblp.org/img/cog.dark.24x24.png)
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.