Richard Chia-Tung Lee

List of publications from the DBLP Bibliography Server - FAQAsk others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

2008 | ||
---|---|---|

118 | Jia Jie Liu, Yue-Li Wang, Richard C. T. Lee: Finding a longest common subsequence between a run-length-encoded string and an uncompressed string. J. Complexity 24(2): 173-184 (2008) | |

2007 | ||

117 | Jia Jie Liu, Guan-Shieng Huang, Yue-Li Wang, Richard C. T. Lee: Edit distance for a run-length-encoded string and an uncompressed string. Inf. Process. Lett. 105(1): 12-16 (2007) | |

2005 | ||

116 | Fang-Rong Hsu, M. K. Shan, H. S. Chao, Richard C. T. Lee: Some Optimal Parallel Algorithms on Interval and Circular-arc Graphs. J. Inf. Sci. Eng. 21(3): 627-642 (2005) | |

115 | Quincy Wu, Chin Lung Lu, Richard Chia-Tung Lee: The approximability of the weighted Hamiltonian path completion problem on a tree. Theor. Comput. Sci. 341(1-3): 385-397 (2005) | |

2004 | ||

114 | Richard C. T. Lee: Application of Visual Display Techniques to Solve Some Biological Problems. BIBE 2004: 493-496 | |

113 | M. C. Chen, Richard C. T. Lee: Sorting by Transpositions Based on the First Increasing Substring Concept. BIBE 2004: 553-560 | |

112 | Shyong Jian Shyu, Yin-Te Tsai, Richard C. T. Lee: The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction. J. Comb. Optim. 8(4): 453-468 (2004) | |

2003 | ||

111 | Natalius Huang, Herng-Yow Chen, Richard C. T. Lee: Web-Based Synchronized Multimedia System Design for Teaching/Learning Chinese as a Foreign Language. KES 2003: 201-207 | |

110 | Chin Lung Lu, Chuan Yi Tang, Richard Chia-Tung Lee: The full Steiner tree problem. Theor. Comput. Sci. 306(1-3): 55-67 (2003) | |

2002 | ||

109 | Chin Lung Lu, Chuan Yi Tang, Richard Chia-Tung Lee: The Full Steiner Tree Problem in Phylogeny. COCOON 2002: 107-116 | |

2000 | ||

108 | Q. S. Wu, Chin Lung Lu, Richard C. T. Lee: An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree. ISAAC 2000: 156-167 | |

107 | H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee: An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs. Discrete Applied Mathematics 102(3): 159-173 (2000) | |

1999 | ||

106 | Chien-Hung Huang, Ju Yuan Hsiao, Richard C. T. Lee, Jywe-Fei Fang: An Optimal Embedding of Incomplete Binary Trees onto Incomplete Hypercubes. ISPAN 1999: 80-87 | |

105 | Chien-Hung Huang, Ju Yuan Hsiao, Richard C. T. Lee: An Optimal Embedding of Cycles into Incomplete Hypercubes. Inf. Process. Lett. 72(5-6): 213-218 (1999) | |

1998 | ||

104 | H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee: An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs. COCOON 1998: 309-318 | |

103 | Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee: The NPO-Completeness of the Longest Hamiltonian Cycle Problem. Inf. Process. Lett. 65(3): 119-123 (1998) | |

1997 | ||

102 | Richard C. T. Lee: Approximation Algorithms. ISPAN 1997: 232 | |

101 | C. Y. Chen, H. F. Lin, Chin-Chen Chang, Richard C. T. Lee: Optimal Bucket Allocation Design of k-ary MKH Files for Partial Match Retrieval. IEEE Trans. Knowl. Data Eng. 9(1): 148-160 (1997) | |

100 | H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee: An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs. Inf. Process. Lett. 61(6): 311-316 (1997) | |

99 | C. Y. Chen, H. F. Lin, Chin-Chen Chang, Richard C. T. Lee: Multidisk Smaller Sized MKH file Allocation for Partial Match Retrieval. J. Inf. Sci. Eng. 13(1): 125-141 (1997) | |

1996 | ||

98 | C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee, D. C. Lin: A Temporal Join Mechanism Based on Trie-Ranking Data Structure. CODAS 1996: 428-435 | |

97 | C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee, D. C. Lin: Optimal Linear Hashing Files for Orthogonal Range Retrieval. COMPSAC 1996: 406-413 | |

96 | Chain-Chin Yen, Richard C. T. Lee: The Weighted Perfect Domination Problem and Its Variants. Discrete Applied Mathematics 66(2): 147-160 (1996) | |

1995 | ||

95 | Chu-Hsing Lin, Chin-Chen Chang, Richard C. T. Lee: New Public-Key Cipher System Based Upon the Diophantine Equations. IEEE Trans. Computers 44(1): 13-19 (1995) | |

94 | Kuo-Liang Chung, Richard C. T. Lee, Yu-Chih Lin: A Generalized Mapping of 2-d Array Processor to Linear Array Processor and its Applications. Parallel Algorithms Appl. 6(4): 241-257 (1995) | |

93 | C. Y. Chen, Chin-Chen Chang, Richard Chia-Tung Lee: A near pattern-matching scheme based upon principal component analysis. Pattern Recognition Letters 16(4): 339-345 (1995) | |

1994 | ||

92 | Bern-Cherng Liaw, Richard C. T. Lee: An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons. Inf. Process. Lett. 52(2): 69-75 (1994) | |

91 | Chen-Hsing Peng, Jia-Shung Wang, Richard C. T. Lee: Recognizing Shortest-Path Trees in Linear Time. Inf. Process. Lett. 52(2): 77-85 (1994) | |

90 | Y. H. Chang, Jia-Shung Wang, Richard C. T. Lee: Generating All Maximal Independent Sets on Trees in Lexicographic Order. Inf. Sci. 76(3-4): 279-296 (1994) | |

89 | J. Liang, Chin-Chen Chang, Ron McFadyen, Richard C. T. Lee: Optimal Multiple Key Hashing Files for Orthogonal Range Queries. Inf. Sci. 79(1-2): 145-158 (1994) | |

88 | Ju Yuan Hsiao, Chuan Yi Tang, Ruay Shiung Chang, Richard C. T. Lee: Single Step Searching in Weighted Block Graphs. Inf. Sci. 81(1-2): 1-29 (1994) | |

1993 | ||

87 | D. P. Wang, Richard C. T. Lee: An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation Problem. CCCG 1993: 334-339 | |

86 | Bern-Cherng Liaw, N. F. Huang, Richard C. T. Lee: The Minimum Cooperative Guards Problem on K-spiral Polygons. CCCG 1993: 97-102 | |

85 | D. P. Wang, N. F. Huang, H. S. Chao, Richard C. T. Lee: Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications. ISAAC 1993: 515-522 | |

84 | R. Z. Hwang, Richard C. T. Lee, R. C. Chang: The Slab Dividing Approach To Solve the Euclidean P-Center Problem. Algorithmica 9(1): 1-22 (1993) | |

83 | R. Z. Hwang, R. C. Chang, Richard C. T. Lee: The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time. Algorithmica 9(4): 398-423 (1993) | |

82 | C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee: Optimal MMI file systems for orthogonal range retrieval. Inf. Syst. 18(1): 37-54 (1993) | |

81 | Chiou-Kuo Liang, Chuan Yi Tang, Richard C. T. Lee: A Different Approach for Solving the Specified Diameter Partition Problem. J. Inf. Sci. Eng. 9(3): 337-357 (1993) | |

80 | Fang-Rong Hsu, R. C. Chang, Richard C. T. Lee: Optimal Parallel Preprocessing Algorithms for Testing Weak Visibility of Polygons from Segments. Parallel Algorithms Appl. 1(2): 83-98 (1993) | |

1992 | ||

79 | Y. H. Chang, Jia-Shung Wang, Richard C. T. Lee: Generating All Maximal Independent Sets on Trees in Lexicographic Order. ICCI 1992: 34-37 | |

78 | R. Z. Hwang, Richard C. T. Lee: The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs. ISAAC 1992: 51-60 | |

77 | Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee: Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs. Algorithmica 8(3): 177-194 (1992) | |

76 | T. H. Hu, Chuan Yi Tang, Richard C. T. Lee: An Average Case Analysis of a Resolution Principle Algorithm in Mechanical Theorem Proving. Ann. Math. Artif. Intell. 6(1-3): 235-251 (1992) | |

75 | Tung-Shou Chen,
Wei-Pang Yang,
Richard C. T. Lee:
Amortized Analysis of Some Disk Scheduling Algorithms: SSTF, SCAN, and N-Step SCAN.
BIT 32(4): 546-558 (1992) | |

74 | Chu-Hsing Lin, Chin-Chen Chang, Richard C. T. Lee: A Record-Oriented Cryptosystem for Database Sharing (Short Note). Comput. J. 35(6): 658-660 (1992) | |

73 | Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee: Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs. Discrete Applied Mathematics 39(1): 1-12 (1992) | |

72 | Fang-Rong Hsu, Richard C. T. Lee, R. C. Chang: Special Subgraphs of Weighted Visibility Graphs. Inf. Process. Lett. 43(2): 69-75 (1992) | |

71 | Yue-Li Wang, Richard C. T. Lee, Jyun-Sheng Chang: Computing the convex hull in a hammock. Inf. Sci. 59(1-2): 103-119 (1992) | |

70 | Chin-Chen Chang, Chu-Hsing Lin, Richard C. T. Lee: Hierarchy representations based on arithmetic coding for dynamic information protection systems. Inf. Sci. 64(1-2): 35-48 (1992) | |

69 | Chu-Hsing Lin, Chin-Chen Chang, Richard C. T. Lee: A conference key broadcasting system using sealed locks. Inf. Syst. 17(4): 323-328 (1992) | |

68 | Fang-Rong Hsu, R. C. Chang, Richard C. T. Lee: Parallel algorithms for computing the closest visible vertex pair between two polygons. Int. J. Comput. Geometry Appl. 2(2): 135-162 (1992) | |

1991 | ||

67 | Wen-Lian Hsu, Richard C. T. Lee: ISA '91 Algorithms, 2nd International Sy,posium on Algorithms, Taipei, Republic of China, December 16-18, 1991, Proceedings Springer 1991 | |

66 | Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen: Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models. ICCI 1991: 350-359 | |

65 | T. H. Hu, Chuan Yi Tang, Richard C. T. Lee: An Average Case Analysis of Monien and Speckenmeyer's Mechanical Theorem Proving Algorithm. ISA 1991: 116-126 | |

64 | Shen-Chuan Tai, M. W. Du, Richard C. T. Lee: Transformation completeness properties of SVPC transformation sets. Discrete Applied Mathematics 32(3): 263-273 (1991) | |

63 | Jyh-Jong Fu, Richard C. T. Lee: Minimum Spanning Trees of Moving Points in the Plane. IEEE Trans. Computers 40(1): 113-118 (1991) | |

62 | Shen-Chuan Tai, M. W. Du, Richard C. T. Lee: A transformational approach to synthesizing combinational circuits. IEEE Trans. on CAD of Integrated Circuits and Systems 10(3): 286-295 (1991) | |

61 | Ming-Tat Ko, Richard C. T. Lee: On weighted rectilinear 2-center and 3-center problems. Inf. Sci. 54(1-2): 169-190 (1991) | |

60 | Chu-Hsing Lin, Chin-Chen Chang, Tzong-Chen Wu, Richard C. T. Lee: Password authentication using Newton's interpolating polynomials. Inf. Syst. 16(1): 97-102 (1991) | |

59 | C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee: On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks. Inf. Syst. 16(6): 613-625 (1991) | |

58 | Jyh-Jong Fu, Richard C. T. Lee: Voronoi diagrams of moving points in the plane. Int. J. Comput. Geometry Appl. 1(1): 23-32 (1991) | |

57 | W. T. Liou, Chuan Yi Tang, Richard C. T. Lee: Covering convex rectilinear polygons in linear time. Int. J. Comput. Geometry Appl. 1(2): 137-185 (1991) | |

1990 | ||

56 | Jyh-Jong Fu, Richard C. T. Lee: Voronoi Diagrams of Moving Points in the Plane. FSTTCS 1990: 238-254 | |

55 | Ming-Shing Yu, C. L. Chen, Richard C. T. Lee: An Optimal Parallel Algorithm for Minimum Coloring of Intervals. ICPP (3) 1990: 162-168 | |

54 | Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee: 20-Relative Neighborhood Graphs Are Hamiltonian. SIGAL International Symposium on Algorithms 1990: 53-65 | |

53 | Ming-Tat Ko, Richard C. T. Lee, Jyun-Sheng Chang: An Optimal Approximation Algorithm for the Rectilinear m-Center Problem. Algorithmica 5(3): 341-352 (1990) | |

52 | Ruay Shiung Chang, Richard C. T. Lee: On the continuous working problem. Discrete Applied Mathematics 28(2): 93-109 (1990) | |

51 | Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen: Parallel Graph Algorithms Based Upon Broadcast Communications. IEEE Trans. Computers 39(12): 1468-1472 (1990) | |

50 | Chin-Wen Ho, Richard C. T. Lee: A Parallel Algorithm for Solving Sparse Triangular Systems. IEEE Trans. Computers 39(6): 848-852 (1990) | |

49 | Jia-Shung Wang, Richard C. T. Lee: An Efficient Channel Routing Algorithm to Yield an Optimal Solution. IEEE Trans. Computers 39(7): 957-962 (1990) | |

48 | W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee: Minimum rectangular partition problem for simple rectilinear polygons. IEEE Trans. on CAD of Integrated Circuits and Systems 9(7): 720-733 (1990) | |

47 | Chain-Chin Yen, Richard C. T. Lee: The Weighted Perfect Domination Problem. Inf. Process. Lett. 35(6): 295-299 (1990) | |

46 | Chu-Hsing Lin, Richard C. T. Lee, Chin-Chen Chang: A Dynamic Access Control Mechanism in Information Protection Systems. J. Inf. Sci. Eng. 6(1): 25-35 (1990) | |

45 | Zen-Cheung Shih, Richard C. T. Lee, S. N. Yang: A parallel algorithm for finding congruent regions. Parallel Computing 13(2): 135-142 (1990) | |

44 | Shyong Jian Shyu, Richard C. T. Lee: Solving the set cover problem on a supercomputer. Parallel Computing 13(3): 295-300 (1990) | |

43 | Shyong Jian Shyu, Richard C. T. Lee: The vectorization of the partition problem. Parallel Computing 16(2-3): 343-350 (1990) | |

1989 | ||

42 | Ming-Shing Yu, C. L. Chen, Richard Chia-Tung Lee: Optimal Parallel Circle-Cover and Independent Set Algorithms for Circular-Arc Graphs. ICPP (3) 1989: 126-129 | |

41 | W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee: Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) Time. Symposium on Computational Geometry 1989: 344-353 | |

40 | Zen-Chung Shih, Richard C. T. Lee, S. N. Yang: A systolic algorithm for extracting regions from a planar graph. Computer Vision, Graphics, and Image Processing 47(2): 227-242 (1989) | |

39 | Cheng-I. Yang, Jia-Shung Wang, Richard Chia-Tung Lee: A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile. Computers & OR 16(3): 257-269 (1989) | |

38 | Yue-Li Wang, Richard C. T. Lee, Jyun-Sheng Chang: The Number of Intersections Between Two Rectangular Paths. IEEE Trans. Computers 38(11): 1564-1571 (1989) | |

37 | Chin-Wen Ho, Richard C. T. Lee: Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel. Inf. Process. Lett. 31(2): 61-68 (1989) | |

36 | Kuo-Liang Chung, Ferng-Ching Lin, Richard C. T. Lee: A Fault-Tolerance Strategy for Pyramid Architecture. J. Inf. Sci. Eng. 5(2): 105-121 (1989) | |

1988 | ||

35 | R. S. Chang, Richard C. T. Lee: On a scheduling problem where a job can be executed only by a limited number of processors. Computers & OR 15(5): 471-478 (1988) | |

34 | Chin-Wen Ho, Richard C. T. Lee: Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs. Inf. Process. Lett. 28(6): 301-309 (1988) | |

1987 | ||

33 | Gen-Huey Chen, Maw-Sheng Chern, Richard C. T. Lee: A New Systolic Architecture for Convex Hull and Half-Plane Intersection Problems. BIT 27(2): 141-147 (1987) | |

32 | Zen-Cheung Shih, Gen-Huey Chen, Richard C. T. Lee: Systolic Algorithms to Examine All Pairs of Elements. Commun. ACM 30(2): 161-167 (1987) | |

1986 | ||

31 | M. T. Fang, Richard C. T. Lee, Chin-Chen Chang: The Idea of De-Clustering and its Applications. VLDB 1986: 181-188 | |

30 | R. C. Chang,
Richard C. T. Lee:
An O(N log N) Minimal Spanning Tree Algorithm for N Points in the Plane.
BIT 26(1): 7-16 (1986) | |

29 | Chin-Chen Chang, Richard C. T. Lee: A Letter-Oriented Minimal Perfect Hashing Scheme. Comput. J. 29(3): 277-281 (1986) | |

28 | Chang-Biau Yang, Richard C. T. Lee: The mapping of 2-D array processors to 1-D array processors. Parallel Computing 3(3): 217-229 (1986) | |

1985 | ||

27 | Chuan Yi Tang, D. J. Fuehrer, Richard C. T. Lee: On the complexity of some multi-attribute file design problems. Inf. Syst. 10(1): 21-25 (1985) | |

26 | S. S. Tseng, Richard C. T. Lee: The Optimality of the Number of k-Sorters of a Parallel Merging Algorithm. J. Inf. Sci. Eng. 1(1): 59-71 (1985) | |

1984 | ||

25 | S. S. Tseng, Richard C. T. Lee: A New Parallel Sorting Algorithm Based Upon Min-Mid-Max Operations. BIT 24(2): 187-195 (1984) | |

24 | R. C. Chang, Richard C. T. Lee: On the Average Length of Delaunay Triangulations. BIT 24(3): 269-273 (1984) | |

23 | S. S. Tseng, Richard C. T. Lee: A Parallel Algorithm to Solve the Stable Marriage Problem. BIT 24(3): 308-316 (1984) | |

22 | Chin-Chen Chang, M. W. Du, Richard C. T. Lee: Performance Analyses of Cartesian Product Files and Random Files. IEEE Trans. Software Eng. 10(1): 88-99 (1984) | |

21 | Chuan Yi Tang, Richard C. T. Lee: Optimal speeding up of parallel algorithms based upon the divide-and-conquer strategy. Inf. Sci. 32(3): 173-186 (1984) | |

1983 | ||

20 | Chin-Chen Chang, M. W. Du, Richard C. T. Lee: The hierarchical ordering in multiattribute files. Inf. Sci. 31(1): 41-75 (1983) | |

1982 | ||

19 | Chin-Chen Chang, Richard C. T. Lee, M. W. Du: Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries. IEEE Trans. Software Eng. 8(3): 235-249 (1982) | |

1980 | ||

18 | Chin-Chen Chang, Richard C. T. Lee, David Hung-Chang Du: Some Properties of Cartesian Product Files. SIGMOD Conference 1980: 157-168 | |

1979 | ||

17 | W. C. Lin, Richard C. T. Lee, David Hung-Chang Du: Common Properties of Some Multiattribute File Systems. IEEE Trans. Software Eng. 5(2): 160-174 (1979) | |

1978 | ||

16 | Richard C. T. Lee, James R. Slagle, C. T. Mong: Towards Automatic Auditing of Records. IEEE Trans. Software Eng. 4(5): 441-448 (1978) | |

1977 | ||

15 | Richard C. T. Lee,
James R. Slagle,
H. Blum:
A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space.
IEEE Trans. Computers 26(3): 288-292 (1977) | |

14 | Andy N. C. Kang, Richard C. T. Lee, Chin-Liang Chang, Shi-Kuo Chang: Storage Reduction Through Minimal Spanning Trees and Spanning Forests. IEEE Trans. Computers 26(5): 425-434 (1977) | |

1976 | ||

13 | Richard C. T. Lee, James R. Slagle, C. T. Mong: Application of Clustering to Estimate Missing Data and Improve Data Integrity. ICSE 1976: 539-544 | |

12 | Richard C. T. Lee, Y. H. Chin, S. C. Chang: Application of Principal Component Analysis to Multikey Searching. IEEE Trans. Software Eng. 2(3): 185-193 (1976) | |

1975 | ||

11 | Richard C. T. Lee: D. Michie, On Machine Intelligence. Artif. Intell. 6(2): 213-214 (1975) | |

1974 | ||

10 | Richard C. T. Lee, Chin-Liang Chang, Richard J. Waldinger: An Improved Program-Synthesizing Algorithm and Its Correctness. Commun. ACM 17(4): 211-217 (1974) | |

9 | James R. Slagle, Chin-Liang Chang, Richard C. T. Lee: Experiments with some cluster analysis algorithms. Pattern Recognition 6(3-4): 181-187 (1974) | |

1973 | ||

8 | Chin-Liang Chang, Richard C. T. Lee, John K. Dixon: The Specialization of Programs by Theorem Proving. SIAM J. Comput. 2(1): 7-15 (1973) | |

1972 | ||

7 | Richard C. T. Lee: Fuzzy Logic and the Resolution Principle. J. ACM 19(1): 109-119 (1972) | |

1971 | ||

6 | Richard C. T. Lee: Fuzzy Logic and the Resolution Principle. IJCAI 1971: 560-567 | |

5 | James R. Slagle, Richard C. T. Lee: Application of Game Tree Searching Techniques to Sequential Pattern Recognition. Commun. ACM 14(2): 103-110 (1971) | |

4 | Richard C. T. Lee, Chin-Liang Chang: Some Properties of Fuzzy Logic Information and Control 19(5): 417-431 (1971) | |

3 | Richard Simon, Richard C. T. Lee: On the Optimal Solutions to AND/OR Series-Parallel Graphs. J. ACM 18(2): 354-372 (1971) | |

1969 | ||

2 | Richard J. Waldinger, Richard C. T. Lee: PROW: A Step Toward Automatic Program Writing. IJCAI 1969: 241-252 | |

1 | James R. Slagle, Chin-Liang Chang, Richard C. T. Lee: Completeness Theorems for Semantic Resolution in Consequence-Finding. IJCAI 1969: 281-286 |