登入選單

返回Google圖書搜尋

A General Theory of Confluent Rewriting Systems for Logic Programming and Its Applications

Jürgen Dix

出版	University of Maryland, 1999
URL	http://books.google.com.hk/books?id=9Ig7HQAACAAJ&hl=&source=gbs_api

註釋

Recently, Brass and Dix showed (Journal of Automated Reasoning 20(1), 1998) that the wellfounded semantics WFS can be defined as a confluent calculus of transformation rules. This lead not only to a simple extension to disjunctive programs (Journal of Logic Programming 38(3), 1999), but also to a new computation of the wellfounded semantics which is linear for a broad class of programs. We take this approach as a starting point and generalize it considerably by