Automated Deduction - CADE-14 de William McCune

Automated Deduction - CADE-14: 14th International Conference on Automated Deduction, Townsville, North Queensland, Australia, July 13 - 17, 1997, Proceedings: Lecture Notes in Computer Science, cartea 1249

William McCune

en Limba Engleză Paperback – 18 iun 1997

This book constitutes the strictly refereed proceedings of the 14th International Conference on Automated Deduction, CADE-14, held in Townsville, North Queensland, Australia, in July 1997.
The volume presents 25 revised full papers selected from a total of 87 submissions; also included are 17 system descriptions and two invited contributions. The papers cover a wide range of current issues in the area including resolution, term rewriting, unification theory, induction, high-order logics, nonstandard logics, AI methods, and applications to software verification, geometry, and social science.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 741^.34 lei
20%

Preț: 340^.22 lei
20%

Preț: 343^.43 lei
20%

Preț: 315^.18 lei
20%

Preț: 327^.41 lei
20%

Preț: 1031^.06 lei
20%

Preț: 438^.67 lei
20%

Preț: 315^.76 lei
20%

Preț: 330^.61 lei
20%

Preț: 148^.66 lei
20%

Preț: 122^.89 lei
20%

Preț: 995^.03 lei
20%

Preț: 562^.71 lei
20%

Preț: 237^.99 lei
20%

Preț: 504^.57 lei
20%

Preț: 332^.20 lei
15%

Preț: 563^.85 lei
20%

Preț: 636^.26 lei
5%

Preț: 365^.59 lei
20%

Preț: 321^.95 lei
20%

Preț: 310^.26 lei
20%

Preț: 607^.38 lei
Preț: 370^.38 lei
20%

Preț: 172^.68 lei
20%

Preț: 315^.76 lei
20%

Preț: 662^.78 lei
20%

Preț: 256^.26 lei
20%

Preț: 440^.36 lei
20%

Preț: 626^.79 lei
20%

Preț: 566^.70 lei
17%

Preț: 360^.19 lei
20%

Preț: 309^.90 lei
20%

Preț: 579^.38 lei
20%

Preț: 301^.94 lei
20%

Preț: 307^.71 lei
20%

Preț: 369^.12 lei
20%

Preț: 330^.61 lei
20%

Preț: 1044^.38 lei
20%

Preț: 574^.58 lei
Preț: 399^.17 lei
20%

Preț: 802^.24 lei
20%

Preț: 569^.11 lei
20%

Preț: 1374^.12 lei
20%

Preț: 333^.84 lei
20%

Preț: 538^.29 lei
20%

Preț: 326^.97 lei

Specificații

ISBN-13: 9783540631040
ISBN-10: 3540631046
Pagini: 484
Ilustrații: XIV, 462 p.
Dimensiuni: 216 x 279 x 25 mm
Greutate: 0.67 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Cuprins

The char-set method and its applications to automated reasoning.- Decidable call by need computations in term rewriting (extended abstract).- A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method.- On equality up-to constraints over finite trees, context unification, and one-step rewriting.- Dedam: A kernel of data structures and algorithms for automated deduction with equality clauses.- The Clause-Diffusion theorem prover Peers-mcd (system description).- Integration of automated and interactive theorem proving in ILF.- ILF-SETHEO.- SETHEO goes software engineering: Application of ATP to software reuse.- Proving System Correctness with KIV 3.0.- A practical symbolic algorithm for the inverse kinematics of 6R manipulators with simple geometry.- Automatic verification of cryptographic protocols with SETHEO.- A practical integration of first-order reasoning and decision procedures.- Some pitfalls of LK-to-LJ translations and how to avoid them.- Deciding intuitionistic propositional logic via translation into classical logic.- Lemma matching for a PTTP-based top-down theorem prover.- Exact knowledge compilation in predicate calculus: The partial achievement case.- Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving.- Alternating automata: Unifying truth and validity checking for temporal logics.- Connection-based proof construction in linear logic.- Resource-distribution via Boolean constraints.- Constructing a normal form for Property Theory.- ?mega: Towards a mathematical assistant.- Plagiator — A learning prover.- CODE: A powerful prover for problems of condensed detachment.- A new method for testing decision procedures in modal logics.- Minlog: A minimal logictheorem prover.- SATO: An efficient prepositional prover.- Using a generalisation critic to find bisimulations for coinductive proofs.- A colored version of the ?-calculus.- A practical implementation of simple consequence relations using inductive definitions.- Soft typing for ordered resolution.- A classification of non-liftable orders for resolution.- Hybrid interactive theorem proving using nuprl and HOL.- Proof tactics for a theory of state machines in a graphical environment.- RALL: Machine-supported proofs for relation algebra.- Nuprl-Light: An implementation framework for higher-order logics.- XIsabelle: A system description.- XBarnacle: Making theorem provers more accessible.- The tableau browser SNARKS.- Jape: A calculator for animating proof-on-paper.- Evolving combinators.- Partial matching for analogy discovery in proofs and counter-examples.- Dialog.