[CEUR Workshop Proceedings] Vol-257

© 2007 for the individual papers by the papers' authors. Copying permitted for private and academic purposes. Re-publication of material on this page requires permission by the copyright owners.

Empirically Successful Automated Reasoning in Large Theories

Proceedings of the CADE-21 Workshop on
Empirically Successful Automated Reasoning in Large Theories
Bremen, Germany, 17th July 2007.

Edited by

Geoff Sutcliffe*, Josef Urban**, and Stephan Schulz***

* Department of Computer Science, University of Miami
P.O. Box 248154, Coral Gables, FL 33124, USA
** Department of Theoretical Computer Science and Mathematical Logic, Charles University
Malostranske namesti 2/25, 118 00 Praha 1, Czech Republic
*** Institut für Informatik 4, Technische Universität München
Boltzmannstr. 3, 85748 Garching b. München, Germany

Table of Contents

Complete proceedings
  1. Leonardo de Moura
    Invited talk: Developing Efficient SMT Solvers
  2. Tim Hinrichs and Michael Genesereth
    Extensional Reasoning
  3. Petr Pudlák
    Semantic Selection of Premisses for Automated Theorem Proving
  4. Josef Urban
    MaLARea: a Metasystem for Automated Reasoning in Large Theories
  5. Keith Goolsbey
    Invited talk: Cyc Design Challenges and Solutions
  6. Adam Pease and Geoff Sutcliffe
    First Order Reasoning on a Large Ontology

submitted by Geoff Sutcliffe, 27-Jun-2007
published on CEUR-WS.org, 27-Jun-2007