Automated Deduction - CADE-20: 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $18.21
Usually ships in 1-2 business days
(Save 85%)
Other sellers (Paperback)
  • All (11) from $18.21   
  • New (6) from $86.74   
  • Used (5) from $18.21   


This book constitutes the refereed proceedings of the 20th International Conference on Automated Deduction, CADE-20, held in Tallinn, Estonia, in July 2005.

The 25 revised full papers and 5 system descriptions presented were carefully reviewed and selected from 78 submissions. All current aspects of automated deduction are addressed, ranging from theoretical and methodological issues to presentation and evaluation of theorem provers and logical reasoning systems.

Read More Show Less

Product Details

Table of Contents

What do we know when we know that a theory is consistent? 1
Reflecting proofs in first-order logic with equality 7
Reasoning in extensional type theory with equality 23
Nominal techniques in Isabelle/HOL 38
Tabling for higher-order logic programming 54
A focusing inverse method theorem prover for first-order linear logic 69
The CoRe calculus 84
Simulating reachability using first-order logic with applications to verification of linked data structures 99
Privacy-sensitive information flow with JML 116
The decidability of the first-order theory of Knuth-Bendix order 131
Well-nested context unification 149
Termination of rewrite systems with shallow right-linear, collapsing, and right-ground rules 164
The OWL instance store : system description 177
Temporal logics over transitive states 182
Deciding monodic fragments by temporal resolution 204
Hierarchic reasoning in local theory extensions 219
Proof planning for first-order temporal logic 235
System description : Multi a multi-strategy proof planner 250
Decision procedures customized for formal verification 255
An algorithm for deciding BAPA : Boolean algebra with Presburger arithmetic 260
Connecting many-sorted theories 278
A proof-producing decision procedure for real arithmetic 295
The MathSAT 3 system 315
Deduction with XOR constraints in security API modelling 322
On the complexity of equational horn clauses 337
A combination method for generating interpolants 353
sKizzo : a suite to evaluate and certify QBFs 369
Regular protocols and attacks with regular knowledge 377
The model evolution calculus with equality 392
Model representation via contexts and implicit generalizations 409
Proving properties of incremental Merkle trees 424
Computer search for counterexamples to Wilkie's identity 441
KRHyper - in your pocket 452
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)