Read more
This volume contains the proceedings of the 20th International Conference on AutomatedDeduction (CADE-20).ItwasheldJuly22 27,2005inTallinn,Es- nia,togetherwiththeWorkshoponConstraintsinFormalVeri?cation(CFV 05), the Workshop on Empirically Successful Classical Automated Reasoning (ES- CAR), the Workshop on Non-Theorems, Non-Validity, Non-Provability (DIS- PROVING), and the yearly CADE ATP System Competition (CASC). CADE is the major forum for the presentation of research in all aspects of automated deduction. The ?rst CADE conference was held in 1974. Early CADEs were mostly biennial, and annual conferences started in 1996. Logics of interest include propositional, ?rst-order, equational, higher-order, classical, intuitionistic, constructive, modal, temporal, many-valued, substr- tural, description, and meta-logics, logical frameworks, type theory and set t- ory. Methods of interest include saturation, resolution, tableaux, sequent calculi, term rewriting, induction, uni?cation, constraint solving, decision procedures, model generation,model checking,natural deduction, proofplanning, proof p- sentation, proof checking, and explanation. Applications of interest include hardwareand softwaredevelopment,systems analysisandveri?cation,deductivedatabases,functionalandlogicprogramming, computer mathematics, natural language processing, computational linguistics, robotics, planning, knowledge representation, and other areas of AI. This year, there were 78 submissions, of which 9 system descriptions. Each submissionwasassignedto atleastfour programcommitteemembers,whoca- fully reviewed the papers, in many cases with the help of one or more of a total number of 115 external referees. For each submission at least four reviews were produced and forwarded to the authors. The merits of the submissions were d- cussed by the programcommittee for ten days through the Internet by means of the EasyChair system. Finally, the program committee selected for publication 25 regular research papers and 5 system descriptions.
List of contents
What Do We Know When We Know That a Theory Is Consistent?.- Reflecting Proofs in First-Order Logic with Equality.- Reasoning in Extensional Type Theory with Equality.- Nominal Techniques in Isabelle/HOL.- Tabling for Higher-Order Logic Programming.- A Focusing Inverse Method Theorem Prover for First-Order Linear Logic.- The CoRe Calculus.- Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures.- Privacy-Sensitive Information Flow with JML.- The Decidability of the First-Order Theory of Knuth-Bendix Order.- Well-Nested Context Unification.- Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules.- The OWL Instance Store: System Description.- Temporal Logics over Transitive States.- Deciding Monodic Fragments by Temporal Resolution.- Hierarchic Reasoning in Local Theory Extensions.- Proof Planning for First-Order Temporal Logic.- System Description: Multi A Multi-strategy Proof Planner.- Decision Procedures Customized for Formal Verification.- An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic.- Connecting Many-Sorted Theories.- A Proof-Producing Decision Procedure for Real Arithmetic.- The MathSAT 3 System.- Deduction with XOR Constraints in Security API Modelling.- On the Complexity of Equational Horn Clauses.- A Combination Method for Generating Interpolants.- sKizzo: A Suite to Evaluate and Certify QBFs.- Regular Protocols and Attacks with Regular Knowledge.- The Model Evolution Calculus with Equality.- Model Representation via Contexts and Implicit Generalizations.- Proving Properties of Incremental Merkle Trees.- Computer Search for Counterexamples to Wilkie's Identity.- KRHyper - In Your Pocket.
