Blick ins Buch

Automated Deduction - CADE-18

18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002 Proceedings

Andrei Voronkov (Herausgeber)

Buch | Softcover

XII, 540 Seiten

2002 | 2002
Springer Berlin (Verlag)
978-3-540-43931-8 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

The First CADE in the Third Millennium This volume contains the papers presented at the Eighteenth International C- ference on Automated Deduction (CADE-18) held on July 27-30th, 2002, at the University of Copenhagen as part of the Federated Logic Conference (FLoC 2002). Despite a large number of deduction-related conferences springing into existence at the end of the last millennium, the CADE conferences continue to be the major forum for the presentation of new research in all aspects of automated deduction. CADE-18 was sponsored by the Association for Auto- ted Reasoning, CADE Inc., the Department of Computer Science at Chalmers University, the Gesellschaft fur ¨ Informatik, Safelogic AB, and the University of Koblenz-Landau. There were 70 submissions, including 60 regular papers and 10 system - scriptions. Each submission was reviewed by at least ?ve program committee members and an electronic program committee meeting was held via the Int- net. The committee decided to accept 27 regular papers and 9 system descr- tions. One paper switched its category after refereeing, thus the total number of system descriptions in this volume is 10. In addition to the refereed papers, this volume contains an extended abstract of the CADE invited talk by Ian Horrocks, the joint CADE/CAV invited talk by Sharad Malik, and the joint CADE-TABLEAUX invited talk by Matthias Baaz. One more invited lecture was given by Daniel Jackson.

Description Logics and Semantic Web.- Reasoning with Expressive Description Logics: Theory and Practice.- BDD-Based Decision Procedures for .- Proof-Carrying Code and Compiler Verification.- Temporal Logic for Proof-Carrying Code.- A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code.- Formal Verification of a Java Compiler in Isabelle.- Non-classical Logics.- Embedding Lax Logic into Intuitionistic Logic.- Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic.- Connection-Based Proof Search in Propositional BI Logic.- System Descriptions.- DDDLIB: A Library for Solving Quantified Difference Inequalities.- An LCF-Style Interface between HOL and First-Order Logic.- System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning.- Proof Development with ?mega.- Learn?matic: System Description.- HyLoRes 1.0: Direct Resolution for Hybrid Logics.- SAT.- Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points.- A Note on Symmetry Heuristics in SEM.- A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions.- Model Generation.- Deductive Search for Errors in Free Data Type Specifications Using Model Generation.- Reasoning by Symmetry and Function Ordering in Finite Model Generation.- Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations.- Session 7.- A New Clausal Class Decidable by Hyperresolution.- CASC.- Spass Version 2.0.- System Description: GrAnDe 1.0.- The HR Program for Theorem Generation.- AutoBayes/CC - Combining Program Synthesis with Automatic Code Certification - System Description -.- CADE-CAV Invited Talk.- The Quest for Efficient Boolean Satisfiability Solvers.- Session 9.- RecursivePath Orderings Can Be Context-Sensitive.- Combination of Decision Procedures.- Shostak Light.- Formal Verification of a Combination Decision Procedure.- Combining Multisets with Integers.- Logical Frameworks.- The Reflection Theorem: A Study in Meta-theoretic Reasoning.- Faster Proof Checking in the Edinburgh Logical Framework.- Solving for Set Variables in Higher-Order Theorem Proving.- Model Checking.- The Complexity of the Graded ?-Calculus.- Lazy Theorem Proving for Bounded Model Checking over Infinite Domains.- Equational Reasoning.- Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation.- Basic Syntactic Mutation.- The Next Waldmeister Loop.- Proof Theory.- Focussing Proof-Net Construction as a Middleware Paradigm.- Proof Analysis by Resolution.

Erscheint lt. Verlag	17.7.2002
Reihe/Serie	Lecture Notes in Artificial Intelligence
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	XII, 540 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	767 g
Themenwelt	Informatik ► Theorie / Studium ► Compilerbau
Themenwelt	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
Schlagworte	Automat • automated code certification • automated deduction • automated reasoning • Compiler • Decision Procedures • Description Logics • Formal Verification • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • meta theory • Model Checking • model Theory • Proof theory • Resolution • semantic web • theorem provers • theorem proving • Type Theory • verification
ISBN-10	3-540-43931-5 / 3540439315
ISBN-13	978-3-540-43931-8 / 9783540439318
Zustand	Neuware