| 000 | 00846namuu2200253 a 4500 | |
| 001 | 000000879218 | |
| 005 | 20040427133018 | |
| 008 | 010207s1999 enka b 001 0 eng d | |
| 010 | ▼z 97028286 | |
| 020 | ▼a 0521779200 (pbk.) | |
| 020 | ▼a 0521455200 (hbk.) | |
| 040 | ▼a IQU ▼c IQU ▼d 211009 | |
| 049 | ▼a KUBA ▼l 121093655 ▼f 과학 | |
| 082 | 0 4 | ▼a 005.131 ▼2 21 |
| 090 | ▼a 005.131 ▼b B111t | |
| 100 | 1 | ▼a Baader, Franz. |
| 245 | 1 0 | ▼a Term rewriting and all that / ▼c Franz Baader and Tobias Nipkow. |
| 250 | ▼a 1st pbk. ed. | |
| 260 | ▼a Cambridge ; ▼a New York : ▼b Cambridge University Press, ▼c 1999. | |
| 300 | ▼a xii, 301 p. : ▼b ill. ; ▼c 25 cm. | |
| 504 | ▼a Includes bibliographical references (p. 284-296) and index. | |
| 650 | 0 | ▼a Rewriting systems (Computer science) |
| 700 | 1 | ▼a Nipkow, Tobias , ▼d 1958- |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 005.131 B111t | 등록번호 121093655 | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
This textbook offers a unified and self-contained introduction to the field of term rewriting. It covers all the basic material (abstract reduction systems, termination, confluence, completion, and combination problems), but also some important and closely connected subjects: universal algebra, unification theory, Grobner bases and Buchberger's algorithm. The main algorithms are presented both informally and as programs in the functional language Standard ML (an appendix contains a quick and easy introduction to ML). Certain crucial algorithms like unification and congruence closure are covered in more depth and Pascal programs are developed. The book contains many examples and over 170 exercises. This text is also an ideal reference book for professional researchers: results that have been spread over many conference and journal articles are collected together in a unified notation, proofs of almost all theorems are provided, and each chapter closes with a guide to the literature.
Unified and self-contained introduction to term-rewriting; suited for students or professionals.
정보제공 :
목차
Preface; 1. Motivating examples; 2. Abstract reduction systems; 3. Universal algebra; 4. Equational problems; 5. Termination; 6. Confluence; 7. Completion; 8. Grobner bases and Buchberger's algorithm; 9. Combination problems; 10. Equational unification; 11. Extensions; Appendix 1. Ordered sets; Appendix 2. A bluffer's guide to ML; Bibliography; Index.
정보제공 :