default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th CADE 2013: Lake Placid, NY, USA
- Maria Paola Bonacina:
Automated Deduction - CADE-24 - 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013. Proceedings. Lecture Notes in Computer Science 7898, Springer 2013, ISBN 978-3-642-38573-5 - Jean-Christophe Filliâtre:
One Logic to Use Them All. 1-20 - Radu Iosif, Adam Rogalewicz, Jirí Simácek:
The Tree Width of Separation Logic with Recursive Definitions. 21-38 - Peter Baumgartner, Uwe Waldmann:
Hierarchic Superposition with Weak Abstraction. 39-57 - Abdelkader Kersani, Nicolas Peltier:
Completeness and Decidability Results for First-Order Clauses with Indices. 58-75 - Marta Cialdea Mayer
:
A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies. 76-90 - Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri:
Tractable Inference Systems: An Extension with a Deducibility Predicate. 91-108 - Noran Azmy, Christoph Weidenbach:
Computing Tiny Clause Normal Forms. 109-125 - Markus Bender, Björn Pelzer, Claudia Schon:
System Description: E-KRHyper 1.4 - Extensions for Unique Names and Description Logic. 126-134 - Bernhard Beckert, Rajeev Goré, Carsten Schürmann:
Analysing Vote Counting Algorithms via Logic - And Its Application to the CADE Election Scheme. 135-144 - Natarajan Shankar:
Automated Reasoning, Fast and Slow. 145-161 - Zakaria Chihani, Dale Miller, Fabien Renaud:
Foundational Proof Certificates in First-Order Logic. 162-177 - Leonardo Mendonça de Moura, Grant Olney Passmore:
Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals. 178-192 - Ulrich Loup, Karsten Scheibler, Florian Corzilius, Erika Ábrahám, Bernd Becker:
A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition. 193-207 - Sicun Gao, Soonho Kong, Edmund M. Clarke:
dReal: An SMT Solver for Nonlinear Theories over the Reals. 208-214 - Graeme Gange, Harald Søndergaard, Peter J. Stuckey, Peter Schachte:
Solving Difference Constraints over Modular Arithmetic. 215-230 - Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse:
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. 231-248 - Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination. 249-266 - Cezary Kaliszyk, Josef Urban:
PRocH: Proof Reconstruction for HOL Light. 267-274 - Rajeev Goré, Jimmy Thomson:
An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description. 275-281 - Chris Hawblitzel, Ming Kawaguchi, Shuvendu K. Lahiri, Henrique Rebêlo:
Towards Modularly Comparing Programs Using Automated Theorem Provers. 282-299 - Reiner Hähnle, Ina Schaefer, Richard Bubel:
Reuse in Software Verification by Abstract Method Calls. 300-314 - Bernhard Beckert, Daniel Bruns:
Dynamic Logic with Trace Semantics. 315-329 - Franz Baader, Stefan Borgwardt, Marcel Lippmann:
Temporalizing Ontology-Based Data Access. 330-344 - Marijn Heule, Warren A. Hunt Jr., Nathan Wetzler:
Verifying Refutations with Extended Resolution. 345-359 - Viorica Sofronie-Stokkermans:
Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems. 360-376 - Andrew Reynolds, Cesare Tinelli, Amit Goel, Sava Krstic, Morgan Deters, Clark W. Barrett:
Quantifier Instantiation Techniques for Finite Model Finding in SMT. 377-391 - Koen Claessen, Moa Johansson, Dan Rosén, Nicholas Smallbone:
Automating Inductive Proofs Using Theory Exploration. 392-406 - Daniel Kühlwein, Stephan Schulz, Josef Urban:
E-MaLeS 1.1. 407-413 - Jasmin Christian Blanchette, Andrei Paskevich:
TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism. 414-420 - Richard Williams, Boris Konev:
Propositional Temporal Proving with Reductions to a SAT Problem. 421-435 - Mark Kaminski, Tobias Tebbi:
InKreSAT: Modal Reasoning via Incremental Reduction to SAT. 436-442 - Gergely Kovásznai, Andreas Fröhlich, Armin Biere:
: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into. 443-449 - Krystof Hoder, Andrei Voronkov:
The 481 Ways to Split a Clause and Deal with Propositional Variables. 450-464
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-04-24 20:50 CEST 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:
