A Proof Theory for General Unification: 11 (Progress in Computer Science and Applied Logic) - Tapa blanda

Snyder, W.

 
9781461267584: A Proof Theory for General Unification: 11 (Progress in Computer Science and Applied Logic)
Tapa blanda
ISBN 10: 1461267587 ISBN 13: 9781461267584
Editorial: Birkhäuser, 2012

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Birkhäuser
Año de publicación
2012
Idioma
Inglés
ISBN 10 
1461267587
ISBN 13 
9781461267584
Encuadernación
Tapa blanda
Número de páginas
188
Contacto del fabricante
no disponible
Persona responsable
no disponible

Otras ediciones populares con el mismo título

9780817635930: A Proof Theory for General Unification: 11 (Progress in Computer Science and Applied Logic)

Edición Destacada

ISBN 10:  0817635939 ISBN 13:  9780817635930
Editorial: Birkhäuser, 1991
Tapa dura