|
|
|
|
| LEADER |
03265nmm a2200301 u 4500 |
| 001 |
EB000618139 |
| 003 |
EBX01000000000000000471221 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9781461204350
|
| 100 |
1 |
|
|a Snyder, W.
|
| 245 |
0 |
0 |
|a A Proof Theory for General Unification
|h Elektronische Ressource
|c by W. Snyder
|
| 250 |
|
|
|a 1st ed. 1991
|
| 260 |
|
|
|a Boston, MA
|b Birkhäuser
|c 1991, 1991
|
| 300 |
|
|
|a VII, 178 p
|b online resource
|
| 505 |
0 |
|
|a 1: Introduction -- 2: Preview -- 3: Preliminaries -- 3.1 Algebraic Background -- 3.2 Substitutions -- 3.3 Unification by Transformations on Systems -- 3.4 Equational Logic -- 3.5 Term Rewriting -- 3.6 Completion of Equational Theories -- 4: E-Unification -- 4.1 Basic Definitions and Results -- 4.2 Methods for E-Unification -- 5: E-Unification via Transformations -- 5.1 The Set of Transformations BT -- 5.2 Soundness of the Set BT -- 5.3 Completeness of the Set BT -- 6: An Improved Set of Transformations -- 6.1 Ground Church-Rosser Systems -- 6.2 Completeness of the Set T -- 6.3 Surreduction -- 6.4 Completeness of the Set T Revisited -- 6.5 Relaxed Paramodulation -- 6.6 Previous Work -- 6.7 Eager Variable Elimination -- 6.8 Current and Future Work -- 6.9 Conclusion -- 7: Higher Order Unification -- 7.1 Preliminaries -- 7.2 Higher Order Unification via Transformations -- 7.3 Huet’s Procedure Revisited -- 7.4 Conclusion -- 8: Conclusion -- Appendices
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Mathematical logic
|
| 653 |
|
|
|a Theory of Computation
|
| 653 |
|
|
|a Mathematical Logic and Foundations
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Progress in Computer Science and Applied Logic
|
| 028 |
5 |
0 |
|a 10.1007/978-1-4612-0435-0
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-1-4612-0435-0?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a 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
|