Entry Hsiang:1987:AIT from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Hsiang:1987:AIT,
author = "Jieh Hsiang and M. Srivas",
title = "Automatic inductive theorem proving using {PROLOG}",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "1",
pages = "3--28",
month = sep,
year = "1987",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4210 (Formal
logic); C6140D (High level languages)",
conflocation = "New Delhi, India; 16-18 Dec. 1985",
conftitle = "Fifth Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony
Brook, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automatic inductive theorem proving; backtracking;
backward chaining; domain partitioning; formal logic;
Horn clauses; lemma; limited forward chaining; PROLOG;
skolemization by need; suspended evaluation; theorem
proving",
pubcountry = "Netherlands A01",
sponsororg = "Indian Inst. Technol.; Tata Inst. Fundamental Res",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- artificial,
35(2)129,
44(2)127,
45(3)293,
54(1)29,
56(3)277,
58(1)155,
59(3)287,
62(0)3,
62(1)187,
65(1)1,
66(2)205,
66(3)255,
67(2)173,
67(2)203,
68(2)135,
68(2)203
- automatic,
37(2)151,
39(2)135,
52(3)177,
59(3)287,
61(1)1,
68(2)175
- backtracking,
59(1)133,
68(1)57
- backward,
48(2)283,
62(1)187
- C1230,
35(2)129,
44(2)127,
54(1)29,
56(3)277,
65(1)1,
66(2)205,
66(3)255,
67(2)173,
67(2)203,
68(2)135,
68(2)203
- C6140D,
56(1)3,
60(2)177
- chaining,
62(1)187,
69(1)55
- clause,
35(2)129,
44(2)127,
52(3)281,
59(3)287,
62(1)187,
63(3)253,
66(1)113,
68(2)135,
68(2)203,
69(1)1
- domain,
36(1)1,
36(1)127,
37(3)305,
41(1)109,
45(2)159,
48(2)229,
52(3)281,
54(1)29,
61(1)67,
68(1)37,
68(3)221,
68(3)303
- evaluation,
41(1)113,
43(2)149,
52(3)205,
52(3)281,
53(1)25,
53(1)z,
59(1)157,
64(2)175,
67(2)261,
69(2)117
- forward,
62(1)187,
69(1)55
- high,
52(3)239,
56(1)3,
60(2)177
- Horn,
41(2)271,
44(2)127,
51(3)309,
62(1)187,
63(3)253,
68(1)113,
68(2)135,
68(2)203
- inductive,
43(1)81,
46(2)175,
55(1)87,
59(1)133,
62(3)289
- intelligence,
35(2)129,
44(2)127,
45(3)293,
54(1)29,
56(3)277,
58(1)155,
59(3)287,
62(0)3,
62(1)187,
65(1)1,
66(2)205,
66(3)255,
67(2)173,
67(2)203,
68(2)135,
68(2)203
- lemma,
36(1)89,
37(2)183,
43(1)117,
59(3)317
- level,
37(3)245,
55(1)1,
55(1)47,
56(1)3,
60(2)177
- limited,
60(3)255
- partitioning,
49(2)239,
49(2)z
- PROLOG,
48(2)229
- proving,
35(2)129,
35(2)215,
37(2)151,
37(2)183,
43(2)123,
43(2)277,
44(2)127,
53(1)125,
54(1)29,
54(2)249,
56(1)135,
56(3)277,
59(1)133,
59(3)287,
67(2)173,
67(2)203,
69(3)243
- theorem,
35(2)129,
37(1)51,
37(1)77,
37(2)183,
38(1)123,
38(1)137,
38(2)143,
39(2)135,
39(2)155,
43(1)91,
43(1)99,
43(2)315,
44(2)127,
44(3)333,
46(2)305,
47(1)1,
48(1)1,
48(2)183,
48(2)201,
49(1)1,
49(2)283,
51(1)117,
52(1)1,
52(1)145,
52(3)205,
52(3)239,
53(1)125,
53(2)169,
54(1)29,
54(2)249,
56(3)277,
57(2)161,
57(2)239,
59(1)133,
59(3)287,
61(1)17,
61(2)279,
64(1)1,
64(1)15,
64(3)331,
65(2)149,
65(3)271,
67(2)173,
67(2)203,
68(1)89,
68(3)277,
69(3)243
- using,
38(2)269,
45(2)193