Automated Reasoning

Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004, Proceedings

AvDavid Basin,Michael Rusinowitch

Häftad, Engelska, 2004

Del i serien Lecture Notes in Computer Science

1 096 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2004-06-22
Mått:155 x 235 x 28 mm
Vikt:768 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:491
Upplaga:2004
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540223450

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

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.- SolvingConstraints 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.