


default search action
2nd PAAR 2010: Edinburgh, UK
- Renate A. Schmidt, Stephan Schulz, Boris Konev:
Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning, PAAR-2010, Edinburgh, Scotland, UK, July 14, 2010. EPiC Series in Computing 9, EasyChair 2012 - Lawrence C. Paulson:
Three Years of Experience with Sledgehammer, a Practical Link between Automatic and Interactive Theorem Provers. 1-10 - Djihed Afifi, David E. Rydeheard, Howard Barringer:
Automated Reasoning in the Simulation of Evolvable Systems. 11-21 - Christoph Benzmüller, Adam Pease:
Progress in Automating Higher-Order Ontology Reasoning. 22-32 - Thomas Bouton, Diego Caminha, David Déharbe, Pascal Fontaine:
GridTPT: a distributed platform for Theorem Prover Testing. 33-39 - Han-Hing Dang, Peter Höfner:
Automated Higher-order Reasoning about Quantales. 40-51 - Guido Fiorino:
Fast Decision Procedure for Propositional Dummett Logic Based on a Multiple Premise Tableau Calculus. 52-62 - Ullrich Hustadt, Renate A. Schmidt:
A Comparison of Solvers for Propositional Dynamic Logic. 63-73 - Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal:
Trie Based Subsumption and Improving the pi-Trie Algorithm. 74-83 - Laura I. Meikle, Jacques D. Fleuriot
:
Automation for Geometry in Isabelle/HOL. 84-94

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.