| A methodology for proving termination of logic programs | |
|---|---|
| 學年 | 83 |
| 學期 | 1 |
| 出版（發表）日期 | 1994-08-01 |
| 作品名稱 | A methodology for proving termination of logic programs |
| 作品名稱（其他語言） | |
| 著者 | 汪柏; Wang, Bal; Shyamasundar, R. K. |
| 單位 | 淡江大學資訊工程學系 |
| 出版者 | Elsevier |
| 著錄名稱、卷期、頁數 | Journal of logic programming 21(1), pp.1-30 |
| 摘要 | In this paper, we describe a methodology for proving termination of logic programs. First, we introduce U-graphs as an abstraction of logic programs and establish that SLDNF derivations can be realized by instances of paths in the U-graphs. Such a relation enables us to use U-graphs for establishing the universal termination of logic programs. In our method, we associate pre- and postassertions to the nodes of the graph and order assertions to selected edges of the graph. With this as the basis, we develop a simple method for establishing the termination of logic programs. The simplicity/practicality of the method is illustrated through examples. |
| 關鍵字 | |
| 語言 | en_US |
| ISSN | 0743-1066 |
| 期刊性質 | 國外 |
| 收錄於 | |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 否 |
| 國別 | USA |
| 公開徵稿 | |
| 出版型式 | ,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45388 ) |
GoogleAnalytics