HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >


Files in This Item:
yokoyama2004jsai-final.pdf224.47 kBPDFView/Open
Please use this identifier to cite or link to this item:

Title: 優先順位と二分決定グラフに基づく複数経路順序下の項書換え系完備化手続き
Other Titles: Completion for Multiple Path Orderings Based on Precedence and Binary Decision Diagrams
Authors: 横山, 壱星1 Browse this author
栗原, 正仁2 Browse this author →KAKEN DB
Authors(alt): Yokoyama, Issei1
Kurihara, Masahito2
Keywords: term rewriting system
path ordering
binary decision diagram
Issue Date: 2004
Publisher: 人工知能学会
Journal Title: 人工知能学会論文誌
Volume: 19
Issue: 6
Start Page: 472
End Page: 482
Publisher DOI: 10.1527/tjsai.19.472
Abstract: 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.
Type: article (author version)
Appears in Collections:情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 栗原 正仁

Export metadata:

OAI-PMH ( junii2 , jpcoar )

MathJax is now OFF:


 - Hokkaido University