0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Mathematical theory of computation

Buy Now

A Proof Theory for General Unification (Hardcover, 1991 ed.) Loot Price: R1,708
Discovery Miles 17 080
A Proof Theory for General Unification (Hardcover, 1991 ed.): W Snyder

A Proof Theory for General Unification (Hardcover, 1991 ed.)

W Snyder

Series: Progress in Computer Science and Applied Logic, 11

 (sign in to rate)
Loot Price R1,708 Discovery Miles 17 080 | Repayment Terms: R160 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

In this monograph we study two generalizations of standard unification, E-unification and higher-order unification, using an abstract approach orig inated by Herbrand and developed in the case of standard first-order unifi cation by Martelli and Montanari. The formalism presents the unification computation as a set of non-deterministic transformation rules for con verting a set of equations to be unified into an explicit representation of a unifier (if such exists). This provides an abstract and mathematically elegant means of analysing the properties of unification in various settings by providing a clean separation of the logical issues from the specification of procedural information, and amounts to a set of 'inference rules' for unification, hence the title of this book. We derive the set of transformations for general E-unification and higher order unification from an analysis of the sense in which terms are 'the same' after application of a unifying substitution. In both cases, this results in a simple extension of the set of basic transformations given by Herbrand Martelli-Montanari for standard unification, and shows clearly the basic relationships of the fundamental operations necessary in each case, and thus the underlying structure of the most important classes of term unifi cation problems."

General

Imprint: Birkhauser Boston
Country of origin: United States
Series: Progress in Computer Science and Applied Logic, 11
Release date: November 1991
First published: 1991
Authors: W Snyder
Dimensions: 235 x 155 x 12mm (L x W x T)
Format: Hardcover
Pages: 178
Edition: 1991 ed.
ISBN-13: 978-0-8176-3593-0
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
Promotions
LSN: 0-8176-3593-9
Barcode: 9780817635930

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Statistical Physics, Optimization…
Florent Krzakala, Federico Ricci Tersenghi, … Hardcover R2,584 Discovery Miles 25 840
Introduction to 3+1 Numerical Relativity
Miguel Alcubierre Hardcover R5,171 Discovery Miles 51 710
Agent-Based Modeling and Network…
Akira Namatame, Shu-Heng Chen Hardcover R3,215 Discovery Miles 32 150
Concentration Inequalities - A…
Stephane Boucheron, Gabor Lugosi, … Hardcover R5,465 Discovery Miles 54 650
Computable Economics - The Arne Ryde…
K. Velupillai Hardcover R5,723 Discovery Miles 57 230
Stochastic Methods in Neuroscience
Carlo Laing, Gabriel J. Lord Hardcover R4,174 Discovery Miles 41 740
Discrete and Combinatorial Mathematics…
Ralph Grimaldi Paperback R2,537 Discovery Miles 25 370
Forbidden Configurations in Discrete…
David Eppstein Hardcover R2,925 Discovery Miles 29 250
Machine Learning with Quantum Computers
Maria Schuld, Francesco Petruccione Hardcover R3,839 Discovery Miles 38 390
Numerical Geometry, Grid Generation and…
Vladimir A. Garanzha, Lennard Kamenski, … Hardcover R6,719 Discovery Miles 67 190
Modeling and Simulating Complex Business…
Zoumpolia Dikopoulou Hardcover R3,794 Discovery Miles 37 940
Techniques for Searching, Parsing, and…
Alberto Pettorossi Hardcover R2,833 Discovery Miles 28 330

See more

Partners