default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Automated Reasoning, Volume 55
Volume 55, Number 1, June 2015
- Lawrence C. Paulson:
A Mechanised Proof of Gödel's Incompleteness Theorems Using Nominal Isabelle. 1-37 - Francisco Botana
, Markus Hohenwarter, Predrag Janicic, Zoltán Kovács, Ivan Petrovic, Tomás Recio, Simon Weitzhofer:
Automated Theorem Proving in GeoGebra: Current Achievements. 39-59 - David R. Cok, Aaron Stump, Tjark Weber:
The 2013 Evaluation of SMT-COMP and SMT-LIB. 61-90
Volume 55, Number 2, August 2015
- Daniel Kühlwein, Josef Urban:
MaLeS: A Framework for Automatic Tuning of Automated Theorem Provers. 91-116 - Jared Davis, Magnus O. Myreen:
The Reflective Milawa Theorem Prover is Sound (Down to the Machine Code that Runs it). 117-183 - Marta Cialdea Mayer:
Erratum to: Extension of a Decision Procedure for a Fragment of Hybrid Logic with Binders. 185
Volume 55, Number 3, October 2015
- Krystyna Trybulec Kuperberg:
Andrzej Trybulec - in Memoriam. 187-190 - Adam Grabowski, Artur Kornilowicz, Adam Naumowicz:
Four Decades of Mizar - Foreword. 191-198 - Chad E. Brown:
Reconsidering Pairs and Functions as Sets. 199-210 - Adam Grabowski:
Mechanizing Complemented Lattices Within Mizar Type System. 211-221 - John Harrison:
Formal Proofs of Hypergeometric Sums - Dedicated to the memory of Andrzej Trybulec. 223-243 - Cezary Kaliszyk, Josef Urban:
MizAR 40 for Mizar 40. 245-256 - Artur Kornilowicz:
Definitional Expansions in Mizar - In memoriam of Andrzej Trybulec, a pioneer of computerized formalization. 257-268 - Alexander V. Lyaletski:
Evidence Algorithm and Inference Search in First-Order Logics. 269-284 - Adam Naumowicz:
Automating Boolean Set Operations in Mizar Proof Checking with the Aid of an External SAT Solver. 285-294 - Karol Pak:
Improving Legibility of Formal Proofs Based on the Close Reference Principle is NP-Hard. 295-306
Volume 55, Number 4, December 2015
- Amy P. Felty, Alberto Momigliano, Brigitte Pientka:
The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations - Part 2 - A Survey. 307-372 - Andrea Asperti:
Reverse Complexity. 373-388 - Christoph Benzmüller, Nik Sultana, Lawrence C. Paulson, Frank Theiss:
The Higher-Order Prover Leo-II. 389-404
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 2024-11-14 20: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:
