| 題名: | A methodology for proving termination of logic programs |
| 作者: | 汪柏;Wang, Bal;Shyamasundar, R. K. |
| 貢獻者: | 淡江大學資訊工程學系 |
| 日期: | 1994-08 |
| 上傳時間: | 2010-03-26 19:12:17 (UTC+8) |
| 出版者: | Elsevier |
| 摘要: | 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. |
| 關聯: | Journal of logic programming 21(1), pp.1-30 |
| DOI: | 10.1016/0743-1066(94)90004-3 |
| 顯示於類別: | [資訊工程學系暨研究所] 期刊論文
|