| Mathematical theory exploration | p. 1 |
| Searching while keeping a trace : the evolution from satisfiability to knowledge compilation | p. 3 |
| Representing and reasoning with operational semantics | p. 4 |
| Flyspeck I : tame graphs | p. 21 |
| Automatic construction and verification of isotopy invariants | p. 36 |
| Pitfalls of a full floating-point proof : example on the formal proof of the Veltkamp/Dekker algorithms | p. 52 |
| Using the TPTP language for writing derivations and finite interpretations | p. 67 |
| Stratified context unification is NP-complete | p. 82 |
| A logical characterization of forward and backward chaining in the inverse method | p. 97 |
| Connection tableaux with lazy paramodulation | p. 112 |
| Blocking and other enhancements for bottom-up model generation methods | p. 125 |
| The MathServe system for semantic Web reasoning services | p. 140 |
| System description : GCLCprover + GeoThms | p. 145 |
| A sufficient completeness checker for linear order-sorted specifications Modulo Axioms | p. 151 |
| Extending the TPTP language to higher-order logic with automated parser generation | p. 156 |
| Extracting programs from constructive HOL proofs via IZF set-theoretic semantics | p. 162 |
| Towards self-verification of HOL light | p. 177 |
| An interpretation of Isabelle/HOL in HOL light | p. 192 |
| Combining type theory and untyped set theory | p. 205 |
| Cut-simulation in impredicative logics | p. 220 |
| Interpolation in local theory extensions | p. 235 |
| Canonical Gentzcn-type Calculi with (n,k)-ary quantifiers | p. 251 |
| Dynamic logic with non-rigid functions | p. 266 |
| AProVE 1.2 : automatic termination proofs in the dependency pair framework | p. 281 |
| CEL - a polynomial-time reasoner for life science ontologies | p. 287 |
| FaCT++ description logic reasoner : system description | p. 292 |
| Importing HOL into Isabelle/HOL | p. 298 |
| Geometric resolution : a proof procedure based on finite model search | p. 303 |
| A powerful technique to eliminate isomorphism in finite model search | p. 318 |
| Automation of recursive path ordering for infinite labelled rewrite systems | p. 332 |
| Strong cut-elimination systems for Hudelmaier's depth-bounded sequent calculus for implicational logic | p. 347 |
| Eliminating redundancy in higher-order unification : a lightweight approach | p. 362 |
| First-order logic with dependent types | p. 377 |
| Automating proofs in category theory | p. 392 |
| Formal global optimisation with taylor models | p. 408 |
| A purely functional library for modular arithmetic and its application to certifying large prime numbers | p. 423 |
| Proving formally the implementation of an efficient gcd algorithm for polynomials | p. 438 |
| A SAT-based decision procedure for the subclass of unrollable list formulas in ACL2 (SULFA) | p. 453 |
| Solving sparse linear constraints | p. 468 |
| Inferring network invariants automatically | p. 483 |
| A recursion combinator for nominal datatypes implemented in Isabelle/HOL | p. 498 |
| Decidability and undecidability results for Nelson-Oppen and rewrite-based decision procedures | p. 513 |
| Verifying mixed real-integer quantifier elimination | p. 528 |
| Presburger modal logic is PSPACE-complete | p. 541 |
| Tree automata with equality constraints modulo equational theories | p. 557 |
| CASC-J3 - the 3rd IJCAR ATP system competition | p. 572 |
| Matrix interpretations for proving termination of term rewriting | p. 574 |
| Partial recursive functions in higher-order logic | p. 589 |
| On the strength of proof-irrelevant type theories | p. 604 |
| Consistency and completeness of rewriting in the calculus of constructions | p. 619 |
| Specifying and reasoning about dynamic access-control policies | p. 632 |
| On keys and functional dependencies as first-class citizens in description logics | p. 647 |
| A resolution-based decision procedure for SHOIQ | p. 662 |
| Table of Contents provided by Blackwell. All Rights Reserved. |