Entry Kerisit:1989:RAL 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{Kerisit:1989:RAL,
author = "J.-M. Kerisit",
title = "A relational approach to logic programming: the
extended {Alexander} method",
journal = j-THEOR-COMP-SCI,
volume = "69",
number = "1",
pages = "55--68",
day = "5",
month = dec,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming); C6170 (Expert
systems)",
corpsource = "BULL CEDIAG, Louveciennes, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness; extended Alexander method; forward
chaining; logic programming; logic resolution;
programming theory; relational approach; relational
calculus; soundness",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- analysis,
36(2)145,
36(2)251,
39(1)15,
39(1)z,
40(2)301,
43(1)81,
46(2)141,
46(2)239,
47(3)299,
49(2)267,
51(1)27,
52(3)269,
53(1)99,
54(1)129,
55(2)265,
56(1)17,
56(1)59,
58(1)155,
59(1)157,
61(2)225,
61(2)259,
62(3)251,
63(1)91,
65(1)1,
65(1)35,
65(2)249,
65(2)z,
66(2)157,
67(2)261,
68(1)57,
69(1)69,
69(2)117
- approach,
36(1)1,
38(2)249,
39(2)155,
40(1)57,
45(3)293,
46(1)13,
54(1)65,
55(1)87,
56(1)17,
57(1)97,
58(1)3,
66(1)27,
66(2)205,
67(1)37,
68(3)277
- C6110,
36(2)145,
39(1)15,
39(1)z,
40(2)301,
46(2)141,
46(2)239,
55(2)265,
59(1)157,
61(2)259,
65(1)1,
65(1)35,
69(1)69
- C6170,
62(1)39,
62(1)187,
69(1)1
- calculus,
37(3)245,
38(2)343,
39(2)135,
39(2)297,
41(1)95,
44(1)51,
44(2)127,
45(2)121,
45(3)293,
46(1)67,
48(1)95,
52(1)1,
52(1)145,
52(3)205,
52(3)307,
53(2)335,
56(2)223,
58(1)143,
59(1)25,
59(1)85,
59(1)181,
59(3)317,
60(3)297,
64(1)55,
65(3)291,
67(1)129,
68(1)105,
68(3)333
- chaining,
54(1)3,
62(1)187
- completeness,
35(2)345,
37(1)1,
39(2)135,
39(2)189,
44(2)127,
46(2)197,
47(1)1,
47(3)263,
48(2)257,
54(2)249,
56(1)135,
56(3)289,
57(2)161,
58(1)155,
61(1)17,
63(1)43,
65(1)1,
65(1)35,
65(1)85,
65(3)343,
67(2)203,
68(3)277,
69(3)289
- expert,
43(1)81,
62(1)39,
62(1)187,
69(1)1
- extended,
38(1)99,
52(1)77,
64(1)55,
68(1)57
- forward,
54(1)3,
62(1)187
- method,
35(2)345,
36(2)145,
39(2)107,
41(1)19,
41(1)33,
44(1)1,
44(2)127,
45(2)193,
46(2)285,
47(3)277,
50(3)285,
52(3)193,
52(3)307,
53(2)345,
54(1)65,
54(1)129,
56(3)277,
58(1)183,
59(1)133,
62(1)187,
63(3)253,
63(3)275,
63(3)303,
65(1)1,
65(2)213,
65(3)291,
67(1)55
- relational,
35(2)165,
38(1)99,
39(2)239,
39(2)309,
43(2)123,
46(1)67,
54(1)103,
62(1)67,
62(1)105,
63(1)63,
63(3)253
- resolution,
35(2)129,
39(2)297,
45(3)293,
56(3)277,
59(1)3,
62(3)311,
65(1)1,
69(1)1
- soundness,
65(1)35,
65(3)343,
69(3)289