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) | 635.90 lei 6-8 săpt. | |
| Springer Berlin, Heidelberg – 10 ian 2012 | 635.90 lei 6-8 săpt. | |
| Springer Berlin, Heidelberg – 9 feb 2012 | 641.95 lei 6-8 săpt. |
Din seria Symbolic Computation
- 20%
Preț: 336.86 lei - 20%
Preț: 626.71 lei - 20%
Preț: 622.59 lei - 20%
Preț: 624.02 lei - 20%
Preț: 623.39 lei - 20%
Preț: 614.65 lei - 20%
Preț: 627.83 lei - 20%
Preț: 617.38 lei - 20%
Preț: 625.93 lei - 20%
Preț: 634.45 lei - 20%
Preț: 620.38 lei - 20%
Preț: 623.39 lei - 20%
Preț: 625.13 lei - 20%
Preț: 621.49 lei -
Preț: 379.31 lei - 20%
Preț: 314.04 lei - 20%
Preț: 329.25 lei - 20%
Preț: 327.04 lei - 20%
Preț: 616.26 lei - 20%
Preț: 632.58 lei - 20%
Preț: 623.22 lei - 15%
Preț: 614.24 lei - 20%
Preț: 632.26 lei - 20%
Preț: 627.51 lei - 20%
Preț: 317.85 lei - 20%
Preț: 682.51 lei - 20%
Preț: 802.33 lei - 20%
Preț: 630.68 lei - 20%
Preț: 312.30 lei - 20%
Preț: 728.16 lei - 20%
Preț: 342.11 lei - 20%
Preț: 315.80 lei - 20%
Preț: 317.68 lei - 20%
Preț: 329.91 lei - 20%
Preț: 534.13 lei
Preț: 635.90 lei
Preț vechi: 794.87 lei
-20% Nou
Puncte Express: 954
Preț estimativ în valută:
112.53€ • 131.23$ • 98.80£
112.53€ • 131.23$ • 98.80£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
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.