Skip to main content
SpringerLink
Log in
Book cover

Automated Reasoning

Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Ulrich Furbach

    1. Department of Computer Science, Artificial Intelligence Research Group, University of Koblenz-Landau, Koblenz

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Natarajan Shankar

    1. SRI International, MS EL256,, Menlo Park, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4130)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Included in the following conference series:

Conference proceedings info: IJCAR 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (53 papers)

  1. Session 5. Proof Theory

    1. Cut-Simulation in Impredicative Logics

      • Christoph E. Benzmüller, Chad E. Brown, Michael Kohlhase
      Pages 220-234

    2. Interpolation in Local Theory Extensions

      • Viorica Sofronie-Stokkermans
      Pages 235-250

    3. Canonical Gentzen-Type Calculi with (n,k)-ary Quantifiers

      • Anna Zamansky, Arnon Avron
      Pages 251-265

    4. Dynamic Logic with Non-rigid Functions

      • Bernhard Beckert, André Platzer
      Pages 266-280

  2. Session 6. System Description 2

    1. AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework

      • Jürgen Giesl, Peter Schneider-Kamp, René Thiemann
      Pages 281-286

    2. CEL — A Polynomial-Time Reasoner for Life Science Ontologies

      • Franz Baader, Carsten Lutz, Boontawee Suntisrivaraporn
      Pages 287-291

    3. FaCT++ Description Logic Reasoner: System Description

      • Dmitry Tsarkov, Ian Horrocks
      Pages 292-297

    4. Importing HOL into Isabelle/HOL

      • Steven Obua, Sebastian Skalberg
      Pages 298-302

  3. Session 7. Search

    1. Geometric Resolution: A Proof Procedure Based on Finite Model Search

      • Hans de Nivelle, Jia Meng
      Pages 303-317

    2. A Powerful Technique to Eliminate Isomorphism in Finite Model Search

      • Xiangxue Jia, Jian Zhang
      Pages 318-331

    3. Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems

      • Adam Koprowski, Hans Zantema
      Pages 332-346

  4. Session 8. Proof Theory

    1. Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic

      • Roy Dyckhoff, Delia Kesner, Stéphane Lengrand
      Pages 347-361

    2. Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach

      • Brigitte Pientka
      Pages 362-376

    3. First-Order Logic with Dependent Types

      • Florian Rabe
      Pages 377-391

  5. Session 9. Proof Checking

    1. Automating Proofs in Category Theory

      • Dexter Kozen, Christoph Kreitz, Eva Richter
      Pages 392-407

    2. Formal Global Optimisation with Taylor Models

      • Roland Zumkeller
      Pages 408-422

    3. A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers

      • Benjamin Grégoire, Laurent Théry
      Pages 423-437

    4. Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials

      • Assia Mahboubi
      Pages 438-452

  6. Session 10. Combination

    1. A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA)

      • Erik Reeber, Warren A. Hunt Jr.
      Pages 453-467

    2. Solving Sparse Linear Constraints

      • Shuvendu K. Lahiri, Madanlal Musuvathi
      Pages 468-482
Back to top

Other volumes

  1. Automated Reasoning

Keywords

About this book

This book constitutes the refereed proceedings of the Third International Joint Conference on Automated Reasoning, IJCAR 2006, held in Seattle, WA, USA in August 2006 as part of the 4th Federated Logic Conference, FLoC 2006. IJCAR 2006 is a merger of CADE, FroCoS, FTP, TABLEAUX, and TPHOLs.

The 41 revised full research papers and 8 revised system descriptions presented together with 3 invited papers and a summary of a systems competition were carefully reviewed and selected from a total of 152 submissions. The papers address the entire spectrum of research in automated reasoning including formalization of mathematics, proof theory, proof search, description logics, interactive proof checking, higher-order logic, combination methods, satisfiability procedures, and rewriting. The papers are organized in topical sections on proofs, search, higher-order logic, proof theory, search, proof checking, combination, decision procedures, CASC-J3, rewriting, and description logic.

Editors and Affiliations

  • Department of Computer Science, Artificial Intelligence Research Group, University of Koblenz-Landau, Koblenz

    Ulrich Furbach

  • SRI International, MS EL256,, Menlo Park, USA

    Natarajan Shankar

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation