A proof theory for general unification
著者
書誌事項
A proof theory for general unification
(Progress in computer science and applied logic, v. 11)
Birkhäuser, 1991
- : Boston
- : Basel
大学図書館所蔵 全19件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Bibliographical references: p. [167]-175
内容説明・目次
内容説明
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.
目次
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.5.1 Termination Orderings.- 3.5.2 Confluence.- 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.2.1 Transformations for Higher Order Unification.- 7.2.2 Soundness of the Transformations.- 7.2.3 Completeness of the Transformations.- 7.3 Huet's Procedure Revisited.- 7.4 Conclusion.- 8: Conclusion.- Appendices.
「Nielsen BookData」 より