Rewriting | |
Invited Talk: Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools | p. 1 |
A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting | p. 45 |
Efficient Checking of Term Ordering Constraints | p. 60 |
Improved Modular Termination Proofs Using Dependency Pairs | p. 75 |
Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure | p. 91 |
Saturation-Based Theorem Proving | |
Redundancy Notions for Paramodulation with Non-monotonic Orderings | p. 107 |
A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards | p. 122 |
Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjectures | p. 137 |
Combination Techniques | |
Decision Procedures for Recursive Data Structures with Integer Constraints | p. 152 |
Modular Proof Systems for Partial Functions with Weak Equality | p. 168 |
A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics | p. 183 |
Verification and Systems | |
Using Automated Theorem Provers to Certify Auto-Generated Aerospace Software | p. 198 |
Argo-lib: A Generic Platform for Decision Procedures | p. 213 |
The ICS Decision Procedures for Embedded Deduction | p. 218 |
System Description: E 0.81 | p. 223 |
Reasoning with Finite Structure | |
Invited Talk: Second-Order Logic over Finite Structures - Report on a Research Programme | p. 229 |
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains | p. 244 |
Tableaux and Non-classical Logics | |
PDL with Negation of Atomic Programs | p. 259 |
Counter-Model Search in Gödel-Dummett Logics | p. 274 |
Generalised Handling of Variables in Disconnection Tableaux | p. 289 |
Applications and Systems | |
Chain Resolution for the Semantic Web | p. 307 |
Sonic - Non-standard Inferences Go OilEd | p. 321 |
TeMP: A Temporal Monodic Prover | p. 326 |
Dr.Doodle: A Diagrammatic Theorem Prover | p. 331 |
Computer Mathematics | |
Invited Talk: Solving Constraints by Elimination Methods | p. 336 |
Analyzing Selected Quantified Integer Programs | p. 342 |
Interactive Theorem Proving | |
Formalizing O Notation in Isabelle/HOL | p. 357 |
Experiments on Supporting Interactive Proof Using Resolution | p. 372 |
A Machine-Checked Formalization of the Generic Model and the Random Oracle Model | p. 385 |
Combinatorial Reasoning | |
Automatic Generation of Classification Theorems for Finite Algebras | p. 400 |
Efficient Algorithms for Computing Modulo Permutation Theories | p. 415 |
Overlapping Leaf Permutative Equations | p. 430 |
Higher-Order Reasoning | |
TaMeD: A Tableau Method for Deduction Modulo | p. 445 |
Lambda Logic | p. 460 |
Formalizing Undefinedness Arising in Calculus | p. 475 |
Competition | |
The CADE ATP System Competition | p. 490 |
Author Index | p. 493 |
Table of Contents provided by Publisher. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.