HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
情報科学研究科  >
雑誌発表論文等  >


yokoyama2004jsai-final.pdf224.47 kBPDF見る/開く

タイトル: 優先順位と二分決定グラフに基づく複数経路順序下の項書換え系完備化手続き
その他のタイトル: Completion for Multiple Path Orderings Based on Precedence and Binary Decision Diagrams
著者: 横山, 壱星 著作を一覧する
栗原, 正仁 著作を一覧する
キーワード: term rewriting system
path ordering
binary decision diagram
発行日: 2004年
出版者: 人工知能学会
誌名: 人工知能学会論文誌
巻: 19
号: 6
開始ページ: 472
終了ページ: 482
出版社 DOI: 10.1527/tjsai.19.472
抄録: In this paper, we propose a completion procedure (called MKBpo) for term rewriting systems. Based on the existing procedure MKB which works with multiple reduction orderings and the ATMS nodes, the MKBpo improves its performance by restricting the class of reduction orderings to precedence-based path orderings, representing them by logical functions in which a logical variable xfg represents the precedence f ≻ g. By using BDD (binary decision diagrams) as a representation of logical functions, the procedure can be implemented efficiently. This makes it possible to save the number of quasi-parallel processes effectively and suppress the rapid increase in the amount of computation time asymptotically.
資料タイプ: article (author version)
出現コレクション:雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

提供者: 栗原 正仁


本サイトに関するご意見・お問い合わせは repo at へお願いします。 - 北海道大学