Automated Reasoning

Basin D.(Ed), Rusinowitch M. (Ed)3540259848

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.

---

Table of contents :
Table of Contents……Page 10
Invited Talk: Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools……Page 14
A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting……Page 58
Efficient Checking of Term Ordering Constraints……Page 73
Improved Modular Termination Proofs Using Dependency Pairs……Page 88
Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure……Page 104
Redundancy Notions for Paramodulation with Non-monotonic Orderings……Page 120
A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards……Page 135
Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjectures……Page 150
Decision Procedures for Recursive Data Structures with Integer Constraints……Page 165
Modular Proof Systems for Partial Functions with Weak Equality……Page 181
A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics……Page 196
Using Automated Theorem Provers to Certify Auto-Generated Aerospace Software……Page 211
ARGO-LIB: A Generic Platform for Decision Procedures……Page 226
The ICS Decision Procedures for Embedded Deduction……Page 231
System Description: E 0.81……Page 236
Invited Talk: Second-Order Logic over Finite Structures – Report on a Research Programme……Page 242
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains……Page 257
PDL with Negation of Atomic Programs……Page 272
Counter-Model Search in Gödel-Dummett Logics……Page 287
Generalised Handling of Variables in Disconnection Tableaux……Page 302
Chain Resolution for the Semantic Web……Page 320
SONIC — Non-standard Inferences Go OILED……Page 334
TeMP: A Temporal Monodic Prover……Page 339
Dr.Doodle: A Diagrammatic Theorem Prover……Page 344
Invited Talk: Solving Constraints by Elimination Methods……Page 349
Analyzing Selected Quantified Integer Programs……Page 355
Formalizing O Notation in Isabelle/HOL……Page 370
Experiments on Supporting Interactive Proof Using Resolution……Page 385
A Machine-Checked Formalization of the Generic Model and the Random Oracle Model……Page 398
Automatic Generation of Classification Theorems for Finite Algebras……Page 413
Efficient Algorithms for Computing Modulo Permutation Theories……Page 428
Overlapping Leaf Permutative Equations……Page 443
TaMeD: A Tableau Method for Deduction Modulo……Page 458
Lambda Logic……Page 473
Formalizing Undefinedness Arising in Calculus……Page 488
The CADE ATP System Competition……Page 503
Author Index……Page 506