Mendeley出力
＜図書＞
The resolution calculus
| 責任表示 | Alexander Leitsch |
|---|---|
| シリーズ | Texts in theoretical computer science ; An EATCS series |
| データ種別 | 図書 |
| 出版情報 | Berlin : Springer , c1997 |
| 本文言語 | 英語 |
| 大きさ | viii, 300 p. ; 24 cm |
| 概要 | This is a completely new presentation of resolution as a logical calculus and as a basis for computational algorithms and decision procedures. The first part deals with the traditional topics (Herbra...d's theorem, completeness of resolution, refinements and deletion) but with many new features and concepts like normalization of clauses, resolution operators and search complexity. The second part gives a systematic treatment of recent research topics. It is shown how resolution decision procedures can be applied to solve the decision problem for some important first-order classes. The complexity of resolution is analyzed in terms of Herbrand complexity, new concepts are used to classify the complexity of refinements, and functional extension is introduced with resolution to give a strong calculus. 続きを見る |
所蔵情報
| 状態 | 巻次 | 所蔵場所 | 請求記号 | 刷年 | 文庫名称 | 資料番号 | コメント | 予約・取寄 | 複写申込 | 自動書庫 |
|---|---|---|---|---|---|---|---|---|---|---|
|
|
|
理系図3F 数理独自 | LEIT/20/1 | 1997 |
|
023211997006021 |
|
書誌詳細
| 一般注記 | Includes bibliographical references and index With 36 figures |
|---|---|
| 著者標目 | *Leitsch, Alexander, 1952- |
| 書誌ID | 1001401886 |
| ISBN | 3540618821 |
| NCID | BA29530994 |
| 巻冊次 | ISBN:3540618821 |
| 登録日 | 2009.11.02 |
| 更新日 | 2009.11.02 |