Automated Deduction - CADE-15

15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings

Häftad, Engelska, 1998

729 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 15th International Conference on Automated Deduction, CADE-15, held in Lindau, Germany, in July 1998.The volume presents three invited contributions together with 25 revised full papers and 10 revised system descriptions; these were selected from a total of 120 submissions. The papers address all current issues in automated deduction and theorem proving based on resolution, superposition, model generation and elimination, or connection tableau calculus, in first-order, higher-order, intuitionistic, or modal logics, and describe applications to geometry, computer algebra, or reactive systems.

Produktinformation

Utgivningsdatum1998-06-24
Mått155 x 235 x 25 mm
Vikt698 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor450
Upplaga1998
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540646754

Tillhör följande kategorier

Artificiell intelligens inom Data och it
Systemvetenskap och AI inom Data och it

Reasoning about deductions in linear logic.- A combination of nonstandard analysis and geometry theorem proving, with application to Newton's Principia.- Proving geometric theorems using clifford algebra and rewrite rules.- System description: similarity-based lemma generation for model elimination.- System description: Verification of distributed Erlang programs.- System description: Cooperation in model elimination: CPTHEO.- System description: CardTAP: The first theorem prover on a smart card.- System description: leanK 2.0.- Extensional higher-order resolution.- X.R.S: Explicit reduction systems — A first-order calculus for higher-order calculi.- About the confluence of equational pattern rewrite systems.- Unification in lambda-calculi with if-then-else.- System description: An equational constraints solver.- System description: CRIL platform for SAT.- System description: Proof planning in higher-order logic with ?Clam.- System description: An interface between CLAM and HOL.- System description: Leo — A higher-order theorem prover.- Superposition for divisible torsion-free abelian groups.- Strict basic superposition.- Elimination of equality via transformation with ordering constraints.- A resolution decision procedure for the guarded fragment.- Combining Hilbert style and semantic reasoning in a resolution framework.- ACL2 support for verification projects.- A fast algorithm for uniform semi-unification.- Termination analysis by inductive evaluation.- Admissibility of fixpoint induction over partial types.- Automated theorem proving in a simple meta-logic for LF.- Deductive vs. model-theoretic approaches to formal verification.- Automated deduction of finite-state control programs for reactive systems.- A proof environment for the development of groupcommunication systems.- On the relationship between non-horn magic sets and relevancy testing.- Certified version of Buchberger's algorithm.- Selectively instantiating definitions.- Using matings for pruning connection tableaux.- On generating small clause normal forms.- Rank/activity: A canonical form for binary resolution.- Towards efficient subsumption.