Entry Baratella:1992:CRA 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{Baratella:1992:CRA,
author = "S. Baratella",
title = "A completeness result for allowed semi-strict programs
with respect to well-behaved and allowed query
clauses",
journal = j-THEOR-COMP-SCI,
volume = "97",
number = "1",
pages = "143--156",
day = "20",
month = apr,
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 = "Dipartimento di Matematica, Trento Univ., Povo,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2-valued logic; 3-valued logical consequences; allowed
query clauses; allowed semi-strict programs;
completeness result; many-valued logics; NAF-rule;
SLDNF-refutation; strictness; sufficient condition;
well-behaved query clauses; well-behavedness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- behavedness, well-,
120(1)83
- clause,
74(2)227,
75(1)67,
75(1)z,
76(2)309,
78(1)245,
89(1)63,
95(1)43,
101(2)239,
105(1)85,
119(1)39,
120(1)1,
120(1)45,
122(1)69,
124(2)343,
129(1)95,
129(1)143,
136(1)277
- completeness,
70(1)99,
70(2)193,
71(1)155,
72(1)55,
72(2)133,
73(2)155,
73(2)177,
74(1)37,
74(2)227,
75(1)85,
75(1)111,
77(1)73,
79(2)295,
79(2)341,
80(2)303,
81(2)223,
83(1)71,
86(1)35,
86(1)81,
86(1)z,
87(1)203,
89(2)207,
91(2)181,
93(2)321,
94(1)101,
95(1)75,
95(1)97,
97(2)199,
104(1)3,
105(2)167,
105(2)217,
109(1)7,
111(1)125,
114(2)231,
118(2)193,
119(1)127,
120(1)83,
122(1)97,
128(1)127,
129(1)143,
129(1)167,
130(2)239,
135(1)11,
135(2)405
- condition,
70(1)35,
70(1)151,
70(2)179,
72(1)27,
74(1)3,
75(1)111,
83(1)57,
83(2)189,
86(1)81,
86(2)233,
87(2)315,
88(2)269,
93(2)185,
93(2)227,
93(2)279,
94(1)101,
94(1)141,
94(2)335,
95(2)307,
97(2)233,
100(1)157,
100(2)267,
100(2)325,
103(1)39,
105(1)7,
109(1)181,
110(1)1,
111(1)89,
112(1)145,
112(2)413,
113(1)93,
118(2)301,
120(1)69,
120(2)197,
121(1)309,
126(2)183,
129(1)123,
131(2)271,
132(1)259
- consequence,
97(1)175,
105(1)57,
105(1)85,
105(2)167,
114(2)317,
131(1)197
- logical,
71(2)227,
74(3)273,
80(2)263,
82(2)403,
85(1)75,
87(1)43,
90(1)61,
90(2)433,
92(2)291,
94(2)237,
94(2)311,
96(1)35,
96(1)73,
96(1)z,
99(1)121,
103(1)143,
103(2)283,
104(1)89,
105(1)57,
106(1)3,
106(2)221,
107(1)145,
110(2)377,
111(1)59,
111(1)191,
111(1)211,
111(1)253,
114(1)3,
116(1)3,
116(1)33,
116(1)151,
118(2)99,
118(2)193,
119(1)145,
120(2)215,
121(1)89,
122(1)119,
122(1)201,
126(1)97,
131(1)197,
132(1)37,
136(1)163
- many-valued,
74(1)37,
77(1)161,
94(1)101,
105(1)7,
131(1)197,
134(1)63
- query,
72(2)147,
73(2)213,
73(3)249,
74(1)95,
76(1)3,
76(1)93,
76(2)223,
77(3)291,
78(1)3,
78(1)137,
78(1)159,
78(1)217,
78(1)z,
82(1)51,
83(2)313,
84(2)199,
85(1)75,
86(1)35,
87(2)263,
93(2)201,
101(1)143,
104(2)207,
116(1)33,
116(1)59,
116(1)95,
116(1)117,
116(1)151,
116(1)195,
116(2)359,
120(1)45,
129(2)397,
130(1)139,
133(2)267,
133(2)421,
134(2)287
- respect,
73(3)265,
82(2)303,
83(2)287,
86(2)377
- result,
70(1)85,
73(1)47,
73(3)249,
73(3)279,
79(1)111,
79(1)137,
80(2)289,
85(2)305,
87(1)203,
87(2)229,
87(2)287,
88(2)231,
91(2)129,
92(2)249,
93(2)265,
94(2)161,
95(1)115,
99(1)1,
104(1)3,
110(1)145,
113(1)119,
116(1)195,
116(2)317,
120(2)197,
121(1)71,
125(2)243,
128(1)3,
134(2)387,
135(2)361,
136(2)507
- strictness,
101(2)177,
105(1)7,
121(1)113
- sufficient,
70(1)151,
70(2)179,
72(1)27,
83(1)71,
86(2)233,
88(2)269,
93(2)185,
93(2)279,
94(1)1,
94(1)101,
94(1)141,
95(2)307,
100(1)157,
100(2)267,
103(1)39,
112(1)145,
113(1)93,
118(2)301,
120(1)69,
129(1)123,
132(1)259
- valued, many-,
74(1)37,
77(1)161,
94(1)101,
105(1)7,
131(1)197,
134(1)63
- well-behavedness,
120(1)83