On the Floyd-Warshall Algorithm for Logic Programs
暂无分享,去创建一个
We explore the possibility of evaluating single-rule Datalog programs efficiently and with logarithmic work space by a natural extension of the Floyd–Warshall algorithm for transitive closure. We characterize exactly the single rule chain programs that can be so evaluated – they are rather modest generalizations of the transitive closure. The proof relies on an interesting language-theoretic concept, total ambiguity. Extensions to more general classes of programs, and more general algorithms, are discussed.
[1] Christos H. Papadimitriou,et al. The parallel complexity of simple logic programs , 1993, JACM.
[2] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[3] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.