Entry Chen:1994:CCS 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{Chen:1994:CCS,
author = "Cheng-Chia Chen and I-Peng Lin",
title = "The computational complexity of the satisfiability of
modal {Horn} clauses for modal propositional logics",
journal = j-THEOR-COMP-SCI,
volume = "129",
number = "1",
pages = "95--121",
day = "20",
month = jun,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:12 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=129&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=129&issue=1&aid=1508",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci. and Inf. Eng., National Taiwan
Univ., Taipei, Taiwan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "CL; computational complexity; Horn clauses; inherent
complexity; K45; K5; KD45; KD5; linear tense logics;
modal Horn clauses; modal propositional logics;
NP-complete; PL; polynomial-time algorithm;
PSPACE-hard; S4.3; S5; satisfiability; SL",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- clause,
74(2)227,
75(1)67,
75(1)z,
76(2)309,
78(1)245,
89(1)63,
95(1)43,
97(1)143,
101(2)239,
105(1)85,
119(1)39,
120(1)1,
120(1)45,
122(1)69,
124(2)343,
129(1)143,
136(1)277
- complete, NP-,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(2)309,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361,
120(2)311,
135(1)155
- hard, PSPACE-,
81(1)137
- horn,
75(1)67,
75(1)z,
78(1)245,
82(2)329,
86(1)93,
86(1)z,
89(1)63,
95(1)43,
100(2)385,
101(1)35,
101(2)239,
116(2)405,
119(1)39,
120(1)1,
120(1)45,
122(1)69,
124(2)343,
136(1)277
- modal,
74(2)239,
83(1)157,
85(2)213,
89(1)161,
90(2)433,
96(1)157,
96(1)249,
105(1)141,
106(1)3,
111(1)191,
111(1)z,
114(1)31,
114(1)149,
119(1)127,
119(1)z,
126(1)77,
129(1)167
- NP-complete,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(2)309,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361
- polynomial-time,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
132(1)179,
134(2)473
- propositional,
85(2)213,
87(1)189,
90(1)185,
90(1)235,
91(2)181,
93(1)159,
102(1)207,
114(2)231,
116(2)405,
118(1)67,
118(2)315,
119(1)223,
119(1)z,
120(1)157,
129(1)167,
131(1)197
- PSPACE-hard,
81(1)137
- satisfiability,
72(2)265,
72(2)z,
81(1)49,
81(1)65,
82(1)141,
94(1)101,
105(1)141,
116(2)405,
134(2)287
- SL,
78(1)245
- tense,
96(1)35
- time, polynomial-,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
132(1)179,
134(2)473