default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th LPAR 2015: Suva, Fiji
- Martin Davis, Ansgar Fehnker
, Annabelle McIver, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings. Lecture Notes in Computer Science 9450, Springer 2015, ISBN 978-3-662-48898-0 - Petr Cintula, Denisa Diaconescu, George Metcalfe:
Skolemization for Substructural Logics. 1-15 - Miika Hannula:
Reasoning About Embedded Dependencies Using Inclusion Dependencies. 16-30 - Miroslav Klimos, Antonín Kucera:
Cobra: A Tool for Solving General Deductive Games. 31-47 - Éric Grégoire, Jean-Marie Lagniez:
On Anti-subsumptive Knowledge Enforcement. 48-62 - Luciano Bello, Daniel Hedin, Andrei Sabelfeld:
Value Sensitivity and Observable Abstract Values for Information Flow Control. 63-78 - Souheib Baarir, Alexandre Duret-Lutz:
SAT-Based Minimization of Deterministic \omega -Automata. 79-87 - Cezary Kaliszyk, Josef Urban:
FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover. 88-96 - Gilles Dowek, Ying Jiang:
Decidability, Introduction Rules and Automata. 97-111 - Adi Sosnovich, Orna Grumberg, Gabi Nakibly:
Analyzing Internet Routing Security Using Model Checking. 112-129 - Michael D. Ernst, Alberto Lovato, Damiano Macedonio, Ciprian Spiridon, Fausto Spoto:
Boolean Formulas for the Static Identification of Injection Attacks in Java. 130-145 - Kaustuv Chaudhuri, Giselle Reis:
An Adequate Compositional Encoding of Bigraph Structure in Linear Logic with Subexponentials. 146-161 - Vojtech Forejt, Jan Krcál, Jan Kretínský:
Controller Synthesis for MDPs and Frequency LTL\GU. 162-177 - Uwe Egly, Florian Lonsing, Johannes Oetsch:
Automated Benchmarking of Incremental SAT and QBF Solvers. 178-186 - Shoshin Nomura, Katsuhiko Sano, Satoshi Tojo:
A Labelled Sequent Calculus for Intuitionistic Public Announcement Logic. 187-202 - Patrick Baillot, Gilles Barthe, Ugo Dal Lago:
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. 203-218 - Dan Rosén, Nicholas Smallbone:
TIP: Tools for Inductive Provers. 219-232 - Franck Cassez, Frowin Ziegler:
Verification of Concurrent Programs Using Trace Abstraction Refinement. 233-248 - Yuya Uezato, Yasuhiko Minamide:
Synchronized Recursive Timed Automata. 249-265 - Dale Miller, Marco Volpe:
Focused Labeled Proof Systems for Modal Logic. 266-280 - Benjamin Aminof, Aniello Murano, Sasha Rubin:
On CTL* with Graded Path Modalities. 281-296 - Chuck C. Liang, Dale Miller:
On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control. 297-312 - Benjamin Aminof, Sasha Rubin, Florian Zuleger:
On the Expressive Power of Communication Primitives in Parameterised Systems. 313-328 - Alexander Steen, Christoph Benzmüller:
There Is No Best \beta -Normalization Strategy for Higher-Order Reasoners. 329-339 - Liana Hadarean, Clark W. Barrett, Andrew Reynolds, Cesare Tinelli, Morgan Deters:
Fine Grained SMT Proofs for the Theory of Fixed-Width Bit-Vectors. 340-355 - Arlen Cox, Bor-Yuh Evan Chang, Huisong Li, Xavier Rival:
Abstract Domains and Solvers for Sets Reasoning. 356-371 - Thibault Gauthier, Cezary Kaliszyk:
Sharing HOL4 and HOL Light Proof Knowledge. 372-386 - Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, Léo Stefanesco, Pierre-Yves Strub:
Relational Reasoning via Probabilistic Coupling. 387-401 - Peter Brottveit Bock, Carsten Schürmann:
A Contextual Logical Framework. 402-417 - Florian Lonsing, Fahiem Bacchus, Armin Biere, Uwe Egly, Martina Seidl:
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination. 418-433 - Wolfgang Ahrendt, Laura Kovács, Simon Robillard:
Reasoning About Loops Using Vampire in KeY. 434-443 - Marijn J. H. Heule, Armin Biere:
Compositional Propositional Proofs. 444-459 - Cvetan Dunchev, Ferruccio Guidi, Claudio Sacerdoti Coen, Enrico Tassi:
ELPI: Fast, Embeddable, λProlog Interpreter. 460-468 - Gaëtan Gilbert, Olivier Hermant:
Normalisation by Completeness with Heyting Algebras. 469-482 - Cristina David, Daniel Kroening, Matt Lewis:
Using Program Synthesis for Program Analysis. 483-498 - Temesghen Kahsai, Jorge A. Navas, Dejan Jovanovic, Martin Schäf:
Finding Inconsistencies in Programs with Loops. 499-514 - Iliano Cervesato, Edmund S. L. Lam:
Modular Multiset Rewriting. 515-531 - Fiona Berreby, Gauvain Bourgne, Jean-Gabriel Ganascia:
Modelling Moral Reasoning and Ethical Responsibility with Logic Programming. 532-548 - Cynthia Kop, Naoki Nishida:
Constrained Term Rewriting tooL. 549-557 - Björn Lellmann, Elaine Pimentel:
Proof Search in Nested Sequent Calculi. 558-574 - Thinh Dong, Chan Le Duc, Philippe Bonnot, Myriam Lamolle:
Tableau-Based Revision over SHIQ TBoxes. 575-590 - Daniel Fava, Julien Signoles, Matthieu Lemerre, Martin Schäf, Ashish Tiwari:
Gamifying Program Analysis. 591-605 - Grigory Fedyukovich, Arie Gurfinkel, Natasha Sharygina:
Automated Discovery of Simulation Between Programs. 606-621 - Koen Claessen, Dan Rosén:
SAT Modulo Intuitionistic Implications. 622-637
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 2025-01-23 20:37 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:
