|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: David Basin , Michael RusinowitchPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2004 ed. Volume: 3097 Dimensions: Width: 15.50cm , Height: 2.60cm , Length: 23.50cm Weight: 1.580kg ISBN: 9783540223450ISBN 10: 3540223452 Pages: 491 Publication Date: 22 June 2004 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsRewriting.- 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.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |