Parallel and Efficient Implementation of the Compartmentalized Connection Graph Proof Procedure: Resolution to Unification
暂无分享,去创建一个
[1] Håkan Millroth. Reforming Compilation of Logic Programs , 1991, ISLP.
[2] Norbert Eisinger. Completeness, confluence, and related properties of clause graph resolution , 1988 .
[3] Robert A. Kowalski,et al. Logic for problem solving , 1982, The computer science library : Artificial intelligence series.
[4] Hans Jürgen Ohlbach. Compilation of Recursive Two-Literal Clauses into Unification Algorithms , 1990, AIMSA.
[5] John C. Mitchell,et al. On the Sequential Nature of Unification , 1984, J. Log. Program..
[6] Norbert Eisinger. A Note on the Completeness of Resolution with Self-Resolution , 1989, Inf. Process. Lett..