Entry Gallier:1989:CST 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{Gallier:1989:CST,
author = "J. H. Gallier and W. Snyder",
title = "Complete sets of transformations for general
{E}-unification",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "2--3",
pages = "203--260",
day = "3",
month = oct,
year = "1989",
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 = "C1160 (Combinatorial mathematics); C1230 (Artificial
intelligence); C4210 (Formal logic)",
conflocation = "Bordeaux, France; 25-27 May 1987",
conftitle = "Second International Conference on Rewriting
Techniques and Applications 'RTA-87'",
corpsource = "Dept. of Comput. and Inf. Sci., Pennsylvania Univ.,
Philadelphia, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary equational theories; complete; complete set;
completeness; critical pairs; equational proofs;
general E-unification; narrowing; prove; rewriting
systems; set theory; sound; surreduction; systems of
terms; theorem proving; transformations; trees; trees
(mathematics); unfailing completion",
pubcountry = "Netherlands",
sponsororg = "Univ. Bordeaux 1; Univ. Nancy 1; City of Bordeaux;
Greco Math. Inf.; Greco Programmation",
treatment = "T Theoretical or Mathematical",
}
Related entries
- arbitrary,
36(1)1,
37(3)269,
38(1)55,
42(1)1,
45(1)87,
45(2)193,
49(2)239,
52(3)177,
55(1)87,
57(2)283,
59(1)133,
59(3)211,
61(1)83,
62(3)289,
64(1)15
- artificial,
35(2)129,
44(2)127,
45(3)293,
54(1)3,
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,
68(2)135,
68(2)203
- C1230,
35(2)129,
44(2)127,
54(1)3,
54(1)29,
56(3)277,
65(1)1,
66(2)205,
66(3)255,
67(2)173,
68(2)135,
68(2)203
- complete,
35(2)245,
37(1)1,
38(1)55,
38(2)157,
38(2)249,
40(2)85,
41(2)141,
42(2)123,
43(2)189,
44(2)199,
44(3)275,
45(1)1,
46(2)319,
47(1)1,
47(1)27,
47(2)169,
52(3)177,
54(2)199,
56(2)211,
57(2)317,
58(1)129,
63(1)43,
63(3)239,
64(1)125,
65(3)343,
67(2)303,
68(1)37,
68(3)267
- 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,
68(3)277,
69(1)55,
69(3)289
- completion,
44(2)127,
66(2)117,
67(2)173,
67(2)303
- critical,
51(1)27,
61(1)17,
61(1)49,
66(2)117
- E-unification,
59(1)3
- equational,
35(1)89,
35(2)129,
42(1)1,
43(2)149,
43(2)189,
55(2)265,
56(1)37,
57(1)3,
61(2)199,
63(3)303,
65(1)85,
67(1)129,
67(2)173,
67(2)303,
69(3)243
- Gallier, J. H.,
37(2)123,
44(3)307,
53(1)125
- general,
39(1)3,
41(1)81,
47(3)315,
49(2)283,
51(3)331
- intelligence,
35(2)129,
44(2)127,
45(3)293,
54(1)3,
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,
68(2)135,
68(2)203
- narrowing,
59(1)3
- pair,
35(2)179,
39(2)337,
41(2)223,
51(1)27,
60(3)285,
66(2)117,
68(2)155
- proof,
35(2)345,
36(2)251,
39(1)27,
39(1)47,
39(1)z,
41(1)121,
42(2)123,
43(1)91,
43(2)345,
44(2)127,
44(3)333,
46(2)261,
46(2)305,
48(2)229,
50(3)241,
52(3)239,
52(3)281,
54(2)199,
57(2)161,
57(2)317,
59(3)317,
61(2)225,
62(3)311,
63(1)91,
65(1)1,
65(1)35,
65(2)149,
66(1)87,
67(1)87,
68(2)123,
68(3)267,
68(3)333,
69(1)69,
69(3)243
- 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)3,
54(1)29,
54(2)249,
56(1)135,
56(3)277,
59(1)133,
59(3)287,
67(2)173,
69(3)243
- rewriting,
35(1)71,
35(2)129,
35(2)337,
37(1)77,
37(2)123,
37(2)217,
40(2)85,
43(2)149,
45(1)1,
45(1)87,
45(3)293,
46(2)305,
47(1)27,
48(2)201,
51(1)27,
52(1)37,
52(3)205,
55(2)141,
56(1)37,
56(3)277,
57(2)205,
61(1)67,
61(1)83,
61(2)317,
65(3)271,
65(3)291,
67(1)19,
67(2)143,
67(2)173,
67(2)261,
67(2)283,
67(2)303,
68(3)319
- sound,
65(3)343,
67(2)303
- term,
35(2)129,
35(2)337,
36(1)71,
37(1)77,
39(2)135,
43(2)149,
45(1)1,
45(3)293,
48(1)95,
51(1)1,
52(1)1,
52(1)37,
52(3)269,
52(3)281,
56(2)223,
64(1)97,
66(1)27,
68(1)71
- 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)3,
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,
68(1)89,
68(3)277,
69(3)243
- transformation,
36(1)27,
37(2)183,
42(1)1,
43(2)123,
46(2)261,
49(1)23,
53(1)151,
57(1)153,
60(3)231,
62(1)3,
65(2)243,
65(2)z,
67(1)55,
68(2)175,
68(3)239
- unification, E-,
59(1)3
- unification, E-,
59(1)3