Cantitate/Preț
Produs
Total produse
Vezi coșul
Automated Deduction - CADE-15 de Claude Kirchner

Automated Deduction - CADE-15

Editat de Claude Kirchner, Helene Kirchner
en Limba Engleză Paperback – 24 iun 1998
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.
Citește tot Restrânge

Preț: 33058 lei

Preț vechi: 41322 lei
-20%

Puncte Express: 496

Carte tipărită la comandă

Livrare economică 20 iulie-03 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540646754
ISBN-10: 3540646752
Pagini: 464
Ilustrații: XIV, 450 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.7 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.