Automated Reasoning: Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004, Proceedings (Lecture Notes in Computer Science (3097))

This Volume Constitutes The Proceedings Of The 2nd International Joint C- Ference On Automated Reasoning (ijcar 2004) Held July 4–8, 2004 In Cork, Ireland. Ijcar 2004 Continued The Tradition Established At The ?rst Ijcar In Siena,italyin2001,whichbroughttogetherdi?erentresearchcommunitieswo- Ing In Automated Reasoning. The Current Ijcar Is The Fusion Of The Following Conferences: Cade: The International Conference On Automated Deduction, Calculemus: Symposium On The Integration Of Symbolic Computation And Mechanized Reasoning, Frocos: Workshop On Frontiers Of Combining Systems, Ftp: The International Workshop On First-order Theorem Proving, And Tableaux: The International Conference On Automated Reasoning With Analytic Tableaux And Related Methods. There Were 74 Research Papers Submitted To Ijcar As Well As 12 System Descriptions. After Extensive Reviewing, 26 Research Papers And 6 System - Scriptions Were Accepted For Presentation At The Conference And Publication In This Volume. In Addition, This Volume Also Contains Papers From The Three Invited Speakers And A Description Of The Cade Atp System Competition. We Would Like To Acknowledge The Enormous Amount Of Work Put In By The Members Of The Program Committee, The Various Organizing And Steering C- Mittees, The Ijcar O?cials, The Invited Speakers, And The Additional Referees Named On The Following Pages. We Would Also Like To Thank Achim Brucker And Barbara Geiser For Their Help In Producing This Volume. Rewriting -- Rewriting Logic Semantics: From Language Specifications To Formal Analysis Tools -- A Redundancy Criterion Based On Ground Reducibility By Ordered Rewriting -- Efficient Checking Of Term Ordering Constraints -- Improved Modular Termination Proofs Using Dependency Pairs -- Deciding Fundamental Properties Of Right-(ground Or Variable) Rewrite Systems By Rewrite Closure -- Saturation-based Theorem Proving -- Redundancy Notions For Paramodulation With Non-monotonic Orderings -- A Resolution Decision Procedure For The Guarded Fragment With Transitive Guards -- Attacking A Protocol For Group Key Agreement By Refuting Incorrect Inductive Conjectures -- Combination Techniques -- Decision Procedures For Recursive Data Structures With Integer Constraints -- Modular Proof Systems For Partial Functions With Weak Equality -- A New Combination Procedure For The Word Problem That Generalizes Fusion Decidability Results In Modal Logics -- Verification And Systems --^ Using Automated Theorem Provers To Certify Auto-generated Aerospace Software -- Argo-lib: A Generic Platform For Decision Procedures -- The Ics Decision Procedures For Embedded Deduction -- System Description: E 0.81 -- Reasoning With Finite Structure -- Second-order Logic Over Finite Structures – Report On A Research Programme -- Efficient Algorithms For Constraint Description Problems Over Finite Totally Ordered Domains -- Tableaux And Non-classical Logics -- Pdl With Negation Of Atomic Programs -- Counter-model Search In Gödel-dummett Logics -- Generalised Handling Of Variables In Disconnection Tableaux -- Applications And Systems -- Chain Resolution For The Semantic Web -- Sonic — Non-standard Inferences Go Oiled -- Temp: A Temporal Monodic Prover -- Dr.doodle: A Diagrammatic Theorem Prover -- Computer Mathematics -- Solving Constraints By Elimination Methods -- Analyzing Selected Quantified Integer Programs -- Interactive Theorem Proving --^ Formalizing O Notation In Isabelle/hol -- Experiments On Supporting Interactive Proof Using Resolution -- A Machine-checked Formalization Of The Generic Model And The Random Oracle Model -- Combinatorial Reasoning -- Automatic Generation Of Classification Theorems For Finite Algebras -- Efficient Algorithms For Computing Modulo Permutation Theories -- Overlapping Leaf Permutative Equations -- Higher-order Reasoning -- Tamed: A Tableau Method For Deduction Modulo -- Lambda Logic -- Formalizing Undefinedness Arising In Calculus -- Competition -- The Cade Atp System Competition. David Basin, Michaël Rusinowitsch (eds.). Includes Bibliographical References And Index. Also Issued Online. Front Matter....Pages - Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools....Pages 1-44 A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting....Pages 45-59 Efficient Checking of Term Ordering Constraints....Pages 60-74 Improved Modular Termination Proofs Using Dependency Pairs....Pages 75-90 Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure....Pages 91-106 Redundancy Notions for Paramodulation with Non-monotonic Orderings....Pages 107-121 A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards....Pages 122-136 Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjectures....Pages 137-151 Decision Procedures for Recursive Data Structures with Integer Constraints....Pages 152-167 Modular Proof Systems for Partial Functions with Weak Equality....Pages 168-182 A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics....Pages 183-197 Using Automated Theorem Provers to Certify Auto-generated Aerospace Software....Pages 198-212 argo-lib : A Generic Platform for Decision Procedures....Pages 213-217 The ICS Decision Procedures for Embedded Deduction....Pages 218-222 System Description: E 0.81....Pages 223-228 Second-Order Logic over Finite Structures – Report on a Research Programme....Pages 229-243 Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains....Pages 244-258 PDL with Negation of Atomic Programs....Pages 259-273 Counter-Model Search in Gödel-Dummett Logics....Pages 274-288 Generalised Handling of Variables in Disconnection Tableaux....Pages 289-306 Chain Resolution for the Semantic Web....Pages 307-320 Sonic — Non-standard Inferences Go OilEd ....Pages 321-325 TeMP : A Temporal Monodic Prover....Pages 326-330 Dr.Doodle: A Diagrammatic Theorem Prover....Pages 331-335 Solving Constraints by Elimination Methods....Pages 336-341 Analyzing Selected Quantified Integer Programs....Pages 342-356 Formalizing O Notation in Isabelle/HOL....Pages 357-371 Experiments on Supporting Interactive Proof Using Resolution....Pages 372-384 A Machine-Checked Formalization of the Generic Model and the Random Oracle Model....Pages 385-399 Automatic Generation of Classification Theorems for Finite Algebras....Pages 400-414 Efficient Algorithms for Computing Modulo Permutation Theories....Pages 415-429 Overlapping Leaf Permutative Equations....Pages 430-444 TaMeD: A Tableau Method for Deduction Modulo....Pages 445-459 Lambda Logic....Pages 460-474 Formalizing Undefinedness Arising in Calculus....Pages 475-489 The CADE ATP System Competition....Pages 490-491 Back Matter....Pages - This book constitutes the refereed proceedings of the Second International Joint Conference on Automated Reasoning, IJCAR 2004, held in Cork, Ireland, in July 2004. IJCAR 2004 comprises CADE, CALCULEMUS, , FroCoS, FTP, and TABLEAUX. The 26 revised full research papers and 6 revised system demonstrations presented together with 3 invited papers and a summary of a systems competition were carefully reviewed and selected from a total of 86 submissions. The papers are organized in topical sections on rewriting, saturation-based theorem proving, combination techniques, verification and systems, reasoning with finite structure, tableaux and non-classical logics, applications and systems, computer mathematics, interactive theorem proving, combinatorial reasoning, and higher-order reasoning Without a precise mathematical semantics compiler writers will often produce incompatible language implementations; and it will be meaningless to even attempt to formally verify a program.