Termination Proofs of Well-Moded Logic Programs Via Conditional Rewrite Systems

Ganzinger, Harald; Waldmann, Uwe

doi:10.1007/3-540-56393-8_34

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Termination Proofs of Well-Moded Logic Programs Via Conditional Rewrite Systems

MPS-Authors

/persons/resource/persons44474

Ganzinger, Harald
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45689

Waldmann, Uwe
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dtn5H
(出版社版)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Ganzinger, H., & Waldmann, U. (1992). Termination Proofs of Well-Moded Logic Programs Via Conditional Rewrite Systems. In M., Rusinowitch, & J.-L., Rémy (Eds.), Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems '92 (pp. 430-437). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-AE21-7

要旨

In this paper, it is shown that a translation from logic programs to
conditional rewrite rules can be used in a straightforward way to check
(semi-automatically) whether a program is terminating under the prolog
selection rule.