REFUTATIONAL THEOREM-PROVING USING TERM-REWRITING SYSTEMS

[1] [Anonymous], SYMBOLIC LOGIC MECHA

[2] [Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[3] NON-RESOLUTION THEOREM PROVING [J]. ARTIFICIAL INTELLIGENCE, 1977, 9 (01) : 1 - 35

[4] BRAND D, 1975, SIAM J COMPUT, V4

[5] DAVIS M, 1980, P NATIONAL C ARTIFIC

[6] ORDERINGS FOR TERM-REWRITING SYSTEMS [J]. THEORETICAL COMPUTER SCIENCE, 1982, 17 (03) : 279 - 301

[7] DERSHOWITZ N, 1983, COMMUNICATION

[8] DERSHOWITZ N, 1983, P SEMINAIRE INFORMAT

[9] FAGES F, 1984, 7TH P C AUT DED NAPP

[10] GOGUEN JA, 1980, 5TH C AUT DED ARCS, P356

[1] [Anonymous], SYMBOLIC LOGIC MECHA

[2] [Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[3] NON-RESOLUTION THEOREM PROVING [J]. ARTIFICIAL INTELLIGENCE, 1977, 9 (01) : 1 - 35

[4] BRAND D, 1975, SIAM J COMPUT, V4

[5] DAVIS M, 1980, P NATIONAL C ARTIFIC

[6] ORDERINGS FOR TERM-REWRITING SYSTEMS [J]. THEORETICAL COMPUTER SCIENCE, 1982, 17 (03) : 279 - 301

[7] DERSHOWITZ N, 1983, COMMUNICATION

[8] DERSHOWITZ N, 1983, P SEMINAIRE INFORMAT

[9] FAGES F, 1984, 7TH P C AUT DED NAPP

[10] GOGUEN JA, 1980, 5TH C AUT DED ARCS, P356