登入
選單
返回
Google圖書搜尋
Modular Termination Proofs for Logic and Pure Prolog Programs
Krzysztof R. Apt
Dino Pedreschi
出版
Centre for Mathematics and Computer Science
, 1993
URL
http://books.google.com.hk/books?id=kFb7GgAACAAJ&hl=&source=gbs_api
註釋
Abstract: "We provide a uniform and simplified presentation of the methods of Bezem [Bez93] (first published as [Bez89]) and of Apt and Pedreschi [AP93] (first published as [AP90]) for proving termination of logic and Prolog programs. Then we show how these methods can be refined so that they can be used in a modular way."
