default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st LPAR 2017: Maun, Botswana
- Thomas Eiter, David Sands:
LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017. EPiC Series in Computing 46, EasyChair 2017 - Jeffrey Fischer, Rupak Majumdar:
Programming by Composing Filters. 1-13 - Tobias Gleißner, Alexander Steen
, Christoph Benzmüller:
Theorem Provers For Every Normal Modal Logic. 14-30 - Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere:
Blocked Clauses in First-Order Logic. 31-48 - Laura Kovács, Andrei Voronkov:
First-Order Interpolation and Interpolating Proof Systems. 49-64 - Tobias Philipp, Adrián Rebola-Pardo:
Towards a Semantics of Unsatisfiability Proofs with Inprocessing. 65-84 - Sarah M. Loos, Geoffrey Irving, Christian Szegedy, Cezary Kaliszyk:
Deep Network Guided Proof Search. 85-105 - Ozan Kahramanogullari:
Deep Proof Search in MELL. 106-124 - Thibault Gauthier, Cezary Kaliszyk, Josef Urban:
TacticToe: Learning to Reason with HOL4 Tactics. 125-143 - Hamza Bourbouh, Pierre-Loïc Garoche, Christophe Garion, Arie Gurfinkel, Temesghen Kahsai, Xavier Thirioux:
Automated analysis of Stateflow models. 144-161 - Josef Lindsberger, Alexander Maringele, Georg Moser:
Quantified Boolean Formulas: Call the Plumber! 162-170 - Nicholas Hollingum, Bernhard Scholz:
Cauliflower: a Solver Generator for Context-Free Language Reachability. 171-180 - Sabine Bauer, Martin Hofmann:
Decidable linear list constraints. 181-199 - Dimas Melo Filho, Fred Freitas, Jens Otten:
RACCOON: A Connection Reasoner for the Description Logic ALC. 200-211 - Miika Hannula, Juha Kontinen, Sebastian Link:
On the Interaction of Inclusion Dependencies with Independence Atoms. 212-226 - Bart Bogaerts, Eugenia Ternovska, David G. Mitchell:
Propagators and Solvers for the Algebra of Modular Systems. 227-248 - Florian Frohn, Jürgen Giesl:
Analyzing Runtime Complexity via Innermost Runtime Complexity. 249-268 - Emmanuel Hainry, Romain Péchoux:
Higher order interpretation for higher order complexity. 269-285 - Yazid Boumarafi, Lakhdar Sais, Yakoub Salhi:
From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes. 286-299 - Rachid Echahed, Aude Maignan:
Parallel Graph Rewriting with Overlapping Rules. 300-318 - Stefano Bistarelli, Fabio Martinelli, Ilaria Matteucci, Francesco Santini:
A Quantitative Partial Model-Checking Function and Its Optimisation. 319-337 - Dmitry Mordvinov, Grigory Fedyukovich:
Synchronizing Constrained Horn Clauses. 338-355 - Frantisek Blahoudek, Alexandre Duret-Lutz, Mikulás Klokocka, Mojmír Kretínský, Jan Strejcek:
Seminator: A Tool for Semi-Determinization of Omega-Automata. 356-367 - Temesghen Kahsai, Rody Kersten, Philipp Rümmer, Martin Schäf:
Quantified Heap Invariants for Object-Oriented Programs. 368-384 - Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub:
Proving uniformity and independence by self-composition and coupling. 385-403 - Matthias Baaz, Norbert Preining:
Gödel logics and the fully boxed fragment of LTL. 404-416 - Agata Ciabattoni, Revantha Ramanayake:
Bunched Hypersequent Calculi for Distributive Substructural Logics. 417-434 - Björn Lellmann, Carlos Olarte, Elaine Pimentel:
A uniform framework for substructural logics with modalities. 435-455 - Nicola Gigante, Angelo Montanari, Mark Reynolds:
A One-Pass Tree-Shaped Tableau for LTL+Past. 456-473 - Jean-Pierre Jouannaud, Pierre-Yves Strub:
Coq without Type Casts: A Complete Proof of Coq Modulo Theory. 474-489 - Hira Taqdees Syeda, Gerwin Klein:
Reasoning about Translation Lookaside Buffers. 490-508 - Luís Cruz-Filipe, Peter Schneider-Kamp:
Formally Proving the Boolean Pythagorean Triples Conjecture. 509-522
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 2026-01-24 01:50 CET 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:
