Entry Marriott:1996:NBC from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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{Marriott:1996:NBC,
author = "Kim Marriott and Martin Odersky",
title = "Negative {Boolean} constraints",
journal = j-THEOR-COMP-SCI,
volume = "160",
number = "1--2",
pages = "365--380",
day = "10",
month = jun,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:01 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=160&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=160&issue=1-2&aid=2150",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240C (Computational
complexity)",
corpsource = "Dept. of Comput. Sci., Monash Univ., Clayton, Vic.,
Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean algebra; complexity; computability;
computational complexity; constraint handling;
constraint logic programming; equivalence; implication;
inequation independence; machine reasoning; negative
Boolean constraints; satisfiability; spatial query
decomposition; validity; variable elimination",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- boolean,
134(1)51,
137(1)109,
137(1)159,
137(2)237,
138(2)353,
139(1)187,
141(1)283,
143(2)335,
143(2)343,
145(1)45,
145(1)371,
155(2)411,
156(1)99,
157(2)139,
160(1)1,
160(1)321,
161(1)141,
161(1)301,
163(1)1,
163(1)283,
168(1)39,
171(1)3,
172(1)135,
172(1)233,
172(1)293,
174(1)137,
175(2)257,
175(2)337,
179(1)251,
179(1)427,
180(1)47,
180(1)155,
180(1)243,
182(1)257,
186(1)171,
188(1)117,
188(1)211,
190(2)317,
191(1)79,
197(1)247,
205(1)317,
207(2)329,
217(2)255,
223(1)193,
226(1)207
- computability,
137(1)129,
139(1)243,
142(1)27,
145(1)111,
147(1)31,
153(1)49,
154(2)145,
155(1)277,
157(1)79,
157(1)91,
157(2)267,
161(1)109,
161(1)289,
162(1)5,
162(1)23,
162(1)45,
162(1)117,
163(1)177,
165(1)133,
166(1)147,
168(2)241,
168(2)461,
171(1)3,
172(1)233,
174(1)137,
175(1)183,
175(2)349,
181(1)195,
184(1)195,
190(2)279,
191(1)145,
191(1)229,
192(2)315,
193(1)149,
194(1)219,
194(1)247-1,
195(2)183,
210(1)73,
219(1)65,
219(1)185,
219(1)287,
219(1)421,
219(1)467,
219(1)487,
224(1)173
- constraint,
138(1)211,
141(1)151,
142(1)27,
142(2)141,
151(1)37,
151(1)z,
156(1)217,
158(1)279,
166(1)101,
167(1)73,
171(1)25,
172(1)233,
173(1)3,
173(1)89,
173(1)113,
173(1)151,
173(1)183,
173(1)209,
173(1)235,
173(1)253,
173(1)283,
175(2)349,
179(1)273,
183(2)281,
184(1)195,
185(1)81,
187(1)49,
190(2)115,
190(2)151,
192(1)77,
192(1)107,
192(2)259,
192(2)315,
193(1)149,
197(1)1,
206(1)81,
206(1)257,
221(1)179,
225(1)113
- decomposition,
140(2)265,
145(1)391,
153(1)271,
154(2)247,
159(1)65,
159(1)105,
160(1)87,
162(2)225,
168(1)121,
187(1)105,
187(1)117,
188(1)59,
224(1)35
- elimination,
156(1)301,
167(1)95,
173(1)283,
196(1)71,
215(1)289
- handling,
137(2)269,
140(2)231,
141(1)53,
142(2)141,
144(1)161,
145(1)345,
147(1)19,
147(1)165,
151(1)37,
155(2)439,
157(1)35,
157(1)115,
158(1)279,
161(1)235,
163(1)145,
163(1)211,
163(1)239,
163(1)259,
164(1)73,
165(2)311,
166(1)101,
171(1)3,
171(1)221,
171(1)247,
173(1)3,
173(1)89,
173(1)113,
173(1)151,
173(1)183,
173(1)209,
173(1)235,
173(1)253,
173(1)283,
178(1)129,
179(1)273,
180(1)203,
181(1)159,
183(2)281,
187(1)105,
187(1)117,
187(1)123,
187(1)147,
187(1)203,
187(1)221,
187(1)231,
187(1)249,
187(1)263,
187(1)z,
188(1)231,
188(1)241,
190(2)115,
192(1)77,
192(1)107,
192(2)259,
193(1)149,
197(1)243
- implication,
165(1)57,
173(1)113
- independence,
172(1)309,
192(2)259
- inequation,
148(1)67,
173(1)89,
173(1)183
- Marriott, Kim,
173(1)209,
183(2)281
- negative,
137(1)145,
143(1)113,
155(1)141,
155(2)365,
160(1)283,
168(1)121,
168(2)405,
192(1)77
- Odersky, Martin,
173(1)209
- reasoning,
137(1)25,
138(1)201,
142(2)277,
149(2)231,
151(2)437,
152(2)219,
152(2)269,
155(1)157,
160(1)321,
166(1)1,
166(1)221,
166(1)291,
167(1)47,
169(2)161,
170(1)129,
170(1)209,
171(1)61,
171(1)111,
171(1)221,
171(1)247,
173(2)311,
177(1)155,
182(1)183,
183(2)253,
184(1)1,
185(1)15,
185(2)277,
189(1)129,
190(2)241,
192(1)3,
192(2)201,
224(1)291
- satisfiability,
137(1)129,
139(1)1,
145(1)111,
146(1)243,
150(1)1,
155(1)277,
161(1)109,
165(1)133,
166(1)147,
170(1)1,
171(1)3,
172(1)233,
175(2)349,
181(1)195,
184(1)195,
191(1)145,
193(1)149,
195(2)183
- spatial,
140(2)231,
140(2)249,
140(2)301,
155(1)39,
175(2)373,
185(2)319
- validity,
146(1)243,
160(1)271
- variable,
138(1)113,
139(1)207,
140(2)231,
140(2)249,
140(2)301,
141(1)269,
142(1)89,
144(1)59,
144(1)125,
144(1)161,
146(1)5,
148(1)141,
149(1)101,
153(1)3,
155(1)85,
155(1)277,
155(2)411,
158(1)279,
162(1)151,
167(1)47,
167(1)95,
167(1)131,
168(1)39,
168(1)155,
169(1)81,
172(1)255,
173(1)183,
173(1)283,
178(1)129,
183(2)187,
185(2)237,
192(1)3,
192(2)201,
197(1)241,
197(1)245,
209(1)237,
217(1)157,
219(1)287,
223(1)193,
224(1)73