Cantitate/Preț
Produs
Total produse
Vezi coșul
Automated Deduction - CADE-11: 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992. Proceedings de Deepak Kapur

Automated Deduction - CADE-11: 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992. Proceedings: Lecture Notes in Computer Science, cartea 607

Editat de Deepak Kapur
en Limba Engleză Paperback – 27 mai 1992
This volume contains the papers presented at the EleventhInternational Conference on Automated Deduction (CADE-11)held in Saratoga Springs, NY, inJune 1992. A total of 136papers were submitted for presentation by researchers fromnearly 20 countries. Papers covered many topics including:resolution; term rewriting; natural deduction; theoremproving, in particular in algebra and geometry; paralleltheoremprovers; unification theory; constraint solving;logic programing; verification; multivalued, temporal andnonclassical logics; non-monotonic reasoning; planning;proof theory; higher-order logics; and inductive theoremproving. Each submission was reviewed by at least threeprogram committee members and 46 papers were selected forpresentation and publication. This volume also containsshort descriptions of 23 implementations of automateddeduction systems. The volume opens with a keynote addressby Larry Wos, winner of the first Herbrand Award forDistinguished Contributions to Automated Reasoning.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 64509 lei

Preț vechi: 80636 lei
-20%

Puncte Express: 968
Preț estimativ în valută:
11404€ • 13597$ • 9891£

Carte tipărită la comandă

Livrare economică 16-30 martie

 Adaugă în coș

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

Specificații

ISBN-13: 9783540556022
ISBN-10: 3540556028
Pagini: 816
Ilustrații: XVI, 800 p.
Dimensiuni: 155 x 235 x 43 mm
Greutate: 1.12 kg
Ediția:1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

The impossibility of the automation of logical reasoning.- Automatic proofs in mathematical logic and analysis.- Proving geometry statements of constructive type.- The central variable strategy of str?ve.- Unification in the union of disjoint equational theories: Combining decision procedures.- Reduction and unification in Lambda calculi with subtypes.- A combinatory logic approach to higher-order E-unification (extended abstract).- Cycle unification.- A parallel completion procedure for term rewriting systems.- Grammar rewriting.- Polynomial interpretations and the complexity of algorithms.- Uniform traversal combinators: Definition, use and properties.- Sorted unification using set constraints.- An abstract view of sorted unification.- Unification in order-sorted algebras with overloading.- Puzzles and paradoxes.- Experiments in automated deduction with condensed detachment.- Caching and lemmaizing in model elimination theorem provers.- LIM+ challenge problems by RUE hyper-resolution.- Computing prime implicates incrementally.- Linear-input subset analysis.- Theoretical study of symmetries in propositional calculus and applications.- Difference matching.- Using middle-out reasoning to control the synthesis of tail-recursive programs.- The use of proof plans to sum series.- Disproving conjectures.- An interval-based temporal logic in a multivalued setting.- A normal form for first-order temporal formulae.- Semantic entailment in non classical logics based on proofs found in classical logic.- Embedding negation as failure into a model generation theorem prover.- Automated correctness proofs of machine code programs for a commercial microprocessor.- Proving the Chinese remainder theorem by the cover set induction.- Automatic program optimization through prooftransformation.- Proof search theory and practice in the (former) USSR (Tentative).- Basic paramodulation and superposition.- Theorem proving with ordering constrained clauses.- The special-relation rules are incomplete.- An improved method for adding equality to free variable semantic tableaux.- Proof search in the intuitionistic sequent calculus.- Implementing the meta-theory of deductive systems.- Tactic-based theorem proving and knowledge-based forward chaining: An experiment with Nuprl and Ontic.- Little theories.- Some termination criteria for narrowing and E-narrowing.- Decidable matching for convergent systems.- Free sequentially in orthogonal order-sorted rewriting systems with constructors.- Programming with equations: A framework for lazy parallel evaluation.- A many sorted logic with possibly empty sorts.- Theorem proving in non-standard logics based on the inverse method.- One more logic with uncertainty and resolution principle for it.- A natural deduction automated theorem proving system.- Isabelle-91.- The semantically guided linear deduction system.- The Shunyata system.- A geometry theorem prover for macintoshes.- FRI: Failure-resistant induction in RRL.- Herky: High performance rewriting in RRL.- IMPS: System description.- Proving equality theorems with hyper-linking.- Xpnet: A graphical interface to proof nets with an efficient proof checker.- &: Automated natural deduction.- An overview of Frapps 2.0: A framework for resolution-based automated proof procedure systems.- The GAZER theorem prover.- ROO: A parallel theorem prover.- RVF: An automated formal verification system.- KPROP — An AND-parallel theorem prover for propositional logic implemented in KL1 system abstract.- A report on ICL HOL.- PVS: A prototype verification system.- The KIVsystem: Systematic construction of verified software.- The tableau-based theorem prover 3 T A P for multiple-valued logics.- Analytica — A theorem prover in mathematica.- The FAUST — prover.- Eves system description.- MGTP: A parallel theorem prover based on lazy model generation.- Benchmark problems in which equality plays the major role.- Computing transitivity tables: A challenge for automated theorem provers.