Automation of Reasoning: Classical Papers on Computational Logic 1957–1966: Symbolic Computation
Editat de J. Siekmann, G. Wrightsonen Limba Engleză Paperback – 10 ian 2012
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (2) | 648.08 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 10 ian 2012 | 648.08 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 9 feb 2012 | 654.23 lei 6-8 săpt. |
Din seria Symbolic Computation
- 20% Preț: 343.16 lei
- 20% Preț: 638.72 lei
- 20% Preț: 634.50 lei
- 20% Preț: 635.96 lei
- 20% Preț: 635.32 lei
- 20% Preț: 626.41 lei
- 20% Preț: 639.85 lei
- 20% Preț: 629.20 lei
- 20% Preț: 637.92 lei
- 20% Preț: 646.61 lei
- 20% Preț: 632.26 lei
- 20% Preț: 635.32 lei
- 20% Preț: 637.10 lei
- 20% Preț: 633.39 lei
- Preț: 386.36 lei
- 20% Preț: 319.89 lei
- 20% Preț: 335.39 lei
- 20% Preț: 333.14 lei
- 20% Preț: 628.05 lei
- 20% Preț: 644.70 lei
- 20% Preț: 635.15 lei
- 15% Preț: 625.98 lei
- 20% Preț: 644.37 lei
- 20% Preț: 639.53 lei
- 20% Preț: 323.77 lei
- 20% Preț: 695.60 lei
- 20% Preț: 817.78 lei
- 20% Preț: 642.77 lei
- 20% Preț: 318.12 lei
- 20% Preț: 742.16 lei
- 20% Preț: 348.51 lei
- 20% Preț: 321.68 lei
- 20% Preț: 323.59 lei
- 20% Preț: 336.06 lei
- 20% Preț: 544.32 lei
Preț: 648.08 lei
Preț vechi: 810.10 lei
-20% Nou
Puncte Express: 972
Preț estimativ în valută:
124.04€ • 130.13$ • 102.90£
124.04€ • 130.13$ • 102.90£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642819544
ISBN-10: 3642819540
Pagini: 544
Ilustrații: XII, 528 p.
Dimensiuni: 170 x 244 x 29 mm
Greutate: 0.86 kg
Ediția:Softcover reprint of the original 1st ed. 1983
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Symbolic Computation, Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642819540
Pagini: 544
Ilustrații: XII, 528 p.
Dimensiuni: 170 x 244 x 29 mm
Greutate: 0.86 kg
Ediția:Softcover reprint of the original 1st ed. 1983
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Symbolic Computation, Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
The Prehistory and Early History of Automated Deduction.- Mechanical Proof Search and the Theory of Logical Deduction in the USSR.- 1957.- A Computer Program for Presburger’s Algorithm.- Empirical Explorations with the Logic Theory Machine: A Case Study in Heuristics.- Proving a Theorem (as Done by Man, Logician or Machine).- 1958.- On Machines Which Prove Theorems.- 1959.- A non-heuristic Program for Proving Elementary Logical Theorems.- Realization of a Geometry-Theorem Proving Machine.- 1960.- A Computing Procedure for Quantification Theory.- Empirical Explorations of the Geometry-Theorem Proving Machine.- A Proof Method for Quantification Theory: Its Justification and Realization.- An Improved Proof Procedure.- A Mechanical Proof Procedure and its Realization in an Electronic Computer.- Proving Theorems by Pattern Recognition.- Toward Mechical Mathematics.- 1962.- A Machine Program for Theorem Proving.- Theorem Testing by Computer.- Exploratory Mathematics by Machine.- Machine-Generated Problem-Solving Graphs.- 1963.- Eliminating the Irrelevant from Mechanical Proofs.- A Semi-Decision Procedure for the Functional Calculus.- A Computer Program for a Solvable Case of the Decision Problem.- A Simplified Proof Method for Elementary Logic.- Theorem-Proving on the Computer.- 1964.- The Unit Preference Strategy in Theorem Proving.- 1965.- A Machine Oriented Logic Based on the Resolution Principle.- Automatic Deduction with Hyper-Resolution.- An Algorithm for a Machine Search of a Natural Logical Deduction in a Propositional Calculus.- Efficiency and Completeness of the Set of Support Strategy in Theorem Proving.- 1966.- Theorem-Proving for Computers: Some Results on Resolution and Renaming.- Bibliography on Computational Logic.