Entry Kounalis:1992:TGC from tcs1990.bib
Last update: Wed Sep 26 02:11:46 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{Kounalis:1992:TGC,
author = "E. Kounalis",
title = "Testing for the ground (co-)reducibility property in
term-rewriting systems",
journal = j-THEOR-COMP-SCI,
volume = "106",
number = "1",
pages = "87--117",
day = "30",
month = nov,
year = "1992",
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/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Lab. d'Inf. de Rouen, Rouen Univ., Mont-Saint-Aignan,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "decidability; ground coreducibility property;
ground-reducible; Knuth--Bendix completion procedure;
mechanizing inductive proofs; rewriting systems;
term-rewriting systems; theorem proving",
pubcountry = "Netherlands",
treatment = "P Practical",
}
Related entries
- Bendix, Knuth-,
81(2)169,
112(1)145
- completion,
72(2)169,
72(2)z,
81(2)169,
85(2)231,
89(1)3,
99(1)65,
104(1)29,
105(1)7,
107(2)277,
112(1)145,
113(1)119
- decidability,
71(1)29,
71(2)265,
71(3)281,
72(1)39,
73(3)295,
74(1)3,
74(1)71,
74(3)341,
78(2)347,
79(1)37,
79(1)263,
80(1)77,
80(2)227,
80(2)303,
81(1)137,
81(2)269,
81(2)289,
82(1)19,
82(1)131,
85(1)33,
85(2)253,
87(1)25,
87(2)287,
88(2)269,
88(2)325,
89(1)33,
91(1)71,
91(1)101,
94(1)1,
94(2)367,
95(1)115,
95(2)187,
96(2)325,
98(1)5,
98(2)199,
99(2)291,
101(1)143,
103(1)39,
103(1)143,
103(2)387,
106(1)135,
106(2)337,
108(1)103,
108(2)237,
109(1)83,
110(1)145,
110(2)419,
112(2)311,
113(1)93,
113(1)119,
114(1)93,
116(2)339,
117(1)39,
118(2)167,
118(2)193,
120(2)229,
121(1)71,
121(1)89,
123(2)315,
126(1)31,
126(1)113,
127(1)1,
127(1)69,
127(1)149,
127(2)229,
129(1)167,
129(2)419,
130(2)239,
131(2)243,
131(2)271,
131(2)431,
131(2)441,
132(1)37,
132(1)85,
132(1)129,
132(1)395,
134(1)107,
134(1)175,
134(2)287,
134(2)311,
134(2)329,
134(2)365,
135(2)345
- ground,
74(2)227,
75(1)85,
75(1)111,
76(2)309,
86(1)81,
100(1)105,
107(2)277,
115(2)391,
127(1)69,
136(1)21
- inductive,
77(3)249,
83(2)249,
85(1)75,
87(1)115,
91(1)101,
101(1)143,
107(2)349,
110(1)131,
110(1)145,
111(1)145,
115(1)63,
131(1)121
- Knuth--Bendix,
81(2)169,
112(1)145
- procedure,
72(2)169,
72(2)265,
80(2)319,
81(2)169,
81(2)223,
82(1)19,
88(2)313,
91(2)265,
93(1)1,
95(1)97,
95(1)115,
97(1)67,
98(1)137,
102(1)1,
103(2)283,
103(2)387,
104(2)207,
107(2)209,
110(2)419,
112(1)145,
113(1)119,
115(1)3,
118(1)81,
119(1)173,
120(1)69,
123(1)55,
124(2)273,
128(1)179,
129(1)167,
133(2)267,
133(2)307
- proving,
71(1)29,
72(2)265,
74(3)253,
75(3)263,
80(2)125,
81(2)223,
83(1)97,
83(2)169,
85(2)231,
85(2)305,
85(2)333,
85(2)353,
87(1)221,
88(1)15,
90(1)61,
91(2)265,
93(1)159,
93(2)321,
94(2)335,
95(2)187,
96(1)157,
101(2)161,
101(2)337,
103(1)25,
103(2)283,
103(2)395,
104(1)29,
104(1)109,
105(1)129,
105(1)141,
106(1)21,
107(2)209,
110(2)249,
113(1)55,
115(1)63,
118(2)193,
119(1)127,
119(1)z,
120(1)1,
120(1)69,
120(1)123,
120(1)157,
124(2)195,
124(2)297,
126(2)143,
127(2)199,
128(1)127,
130(2)239,
133(2)205,
133(2)307,
134(2)403,
134(2)545,
135(1)5,
135(1)111,
135(2)319,
135(2)345
- rewriting, term-,
81(2)169,
105(1)129,
109(1)7
- term-rewriting,
81(2)169,
105(1)129,
109(1)7
- testing,
74(1)19,
80(2)227,
80(2)263,
80(2)319,
84(2)225,
87(1)97,
88(1)59,
93(2)279,
94(1)141,
94(2)237,
95(1)1,
95(2)263,
96(1)157,
99(2)265,
103(2)191,
103(2)205,
105(1)129,
107(2)305,
113(1)93,
118(2)99,
119(1)23,
119(1)173,
119(1)z,
119(2)331,
120(1)69,
120(1)83,
120(1)123,
125(1)61,
125(1)91,
125(1)111,
125(1)131,
128(1)99,
128(1)127,
128(1)159,
128(1)179,
128(1)241,
129(2)397,
131(1)95,
134(2)287