A Proof Theory for General Unification / Progress in Computer Science and Applied Logic Bd.11 (PDF)
(Sprache: Englisch)
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...
Leider schon ausverkauft
eBook (pdf)
54.99 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „A Proof Theory for General Unification / Progress in Computer Science and Applied Logic Bd.11 (PDF)“
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.
Bibliographische Angaben
- Autor: W. Snyder
- 2012, 1991, 178 Seiten, Englisch
- Verlag: Birkhäuser Boston
- ISBN-10: 1461204356
- ISBN-13: 9781461204350
- Erscheinungsdatum: 06.12.2012
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Größe: 13 MB
- Mit Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kopierschutz
Dieses eBook können Sie uneingeschränkt auf allen Geräten der tolino Familie lesen. Zum Lesen auf sonstigen eReadern und am PC benötigen Sie eine Adobe ID.
Kommentar zu "A Proof Theory for General Unification / Progress in Computer Science and Applied Logic Bd.11"
Schreiben Sie einen Kommentar zu "A Proof Theory for General Unification / Progress in Computer Science and Applied Logic Bd.11".
Kommentar verfassen