-
2
-
-
0026187522
-
Bounded Queries to SAT and the Boolean Hierarchy
-
R. Beigel. Bounded Queries to SAT and the Boolean Hierarchy. TCS, 84(2): 199-223, 1991.
-
(1991)
TCS
, vol.84
, Issue.2
, pp. 199-223
-
-
Beigel, R.1
-
4
-
-
0030164857
-
Querying Disjunctive Databases Through Nonmonotonic Logics
-
P. A. Bonatti and T. Eiter. Querying Disjunctive Databases Through Nonmonotonic Logics. TCS, 160:321-363, 1996.
-
(1996)
TCS
, vol.160
, pp. 321-363
-
-
Bonatti, P.A.1
Eiter, T.2
-
6
-
-
0026123004
-
On Truth-Table Reducibility to SAT
-
S. Buss and L. Hay. On Truth-Table Reducibility to SAT. Information and Computation, 91:86-102, 1991.
-
(1991)
Information and Computation
, vol.91
, pp. 86-102
-
-
Buss, S.1
Hay, L.2
-
7
-
-
0024142223
-
The Boolean Hierarchy I: Structural Properties
-
J.-Y. Cai, et al. The Boolean Hierarchy I: Structural Properties. SIAM J. Computing, 17(6):1233-1252, 1988.
-
(1988)
SIAM J. Computing
, vol.17
, Issue.6
, pp. 1233-1252
-
-
Cai, J.-Y.1
-
11
-
-
85156265719
-
Investigations into a Theory of Knowledge Base Revision: Preliminary Report
-
M. Dalai. Investigations into a Theory of Knowledge Base Revision: Preliminary Report. In Proc. AAAI '88, pages 475-479, 1988.
-
(1988)
Proc. AAAI '88
, pp. 475-479
-
-
Dalai, M.1
-
14
-
-
0026940077
-
On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals
-
T. Eiter and G. Gottlob. On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. Art. Intelligence, 57(2-3):227-270, 1992.
-
(1992)
Art. Intelligence
, vol.57
, Issue.2-3
, pp. 227-270
-
-
Eiter, T.1
Gottlob, G.2
-
15
-
-
0029236521
-
The Complexity of Logic-Based Abduction
-
January
-
T. Eiter and G. Gottlob. The Complexity of Logic-Based Abduction. JACM, 42(1):3-42, January 1995.
-
(1995)
JACM
, vol.42
, Issue.1
, pp. 3-42
-
-
Eiter, T.1
Gottlob, G.2
-
16
-
-
0031359893
-
Abduction From Logic Programs: Semantics and Complexity
-
T. Eiter, G. Gottlob, and N. Leone. Abduction From Logic Programs: Semantics and Complexity. TCS, 1997.
-
(1997)
TCS
-
-
Eiter, T.1
Gottlob, G.2
Leone, N.3
-
17
-
-
0345506733
-
Modular Logic Programming and Generalized Quantifiers
-
LNCS, forthcoming
-
T. Eiter, G. Gottlob, and H. Veith. Modular Logic Programming and Generalized Quantifiers. In Proc LPNMR '97, LNCS, 1997, forthcoming.
-
(1997)
Proc LPNMR '97
-
-
Eiter, T.1
Gottlob, G.2
Veith, H.3
-
18
-
-
0002188798
-
Generalized First-Order Spectra and Polynomial-Time Recognizable Sets
-
R. M. Karp, editor, AMS
-
R. Fagin. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In R. M. Karp, editor, Complexity of Computation, pp. 43-74. AMS, 1974.
-
(1974)
Complexity of Computation
, pp. 43-74
-
-
Fagin, R.1
-
19
-
-
0002950863
-
Probabilities on Finite Models
-
R. Fagin. Probabilities on Finite Models. J. Symbolic Logic, 41:50-58, 1976.
-
(1976)
J. Symbolic Logic
, vol.41
, pp. 50-58
-
-
Fagin, R.1
-
20
-
-
84913375409
-
The Complexity of Optimization Functions
-
Dept, of Computer Science, University of Maryland
-
W. Gasarch. The Complexity of Optimization Functions. Technical Report 1652, Dept, of Computer Science, University of Maryland, 1986.
-
(1986)
Technical Report 1652
-
-
Gasarch, W.1
-
21
-
-
84976722921
-
On Checking Versus Evaluation of Multiple Queries
-
LNCS
-
W. Gasarch, L. A. Hemachandra, and A. Hoene. On Checking Versus Evaluation of Multiple Queries. In Proc. MFCS '90, LNCS 452, pp. 261-268, 1990.
-
(1990)
Proc. MFCS '90
, vol.452
, pp. 261-268
-
-
Gasarch, W.1
Hemachandra, L.A.2
Hoene, A.3
-
22
-
-
77951505493
-
Classical Negation in Logic Programs and Disjunctive Databases
-
M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-385, 1991.
-
(1991)
New Generation Computing
, vol.9
, pp. 365-385
-
-
Gelfond, M.1
Lifschitz, V.2
-
23
-
-
0000005812
-
Range and Degree of Realizability of Formulas in the Restricted Predicate Calculus
-
Y. Glebskii et al. Range and Degree of Realizability of Formulas in the Restricted Predicate Calculus. Kibernetika, pp. 17-28, 1969.
-
(1969)
Kibernetika
, pp. 17-28
-
-
Glebskii, Y.1
-
25
-
-
0000898194
-
Complexity Results for Nonmonotonic Logics. J
-
G. Gottlob. Complexity Results for Nonmonotonic Logics. J. Logic and Computation, 2(3):397-425, 1992.
-
(1992)
Logic and Computation
, vol.2
, Issue.3
, pp. 397-425
-
-
Gottlob, G.1
-
26
-
-
0029271767
-
NP Trees and Carnap’s Modal Logic
-
Abstract Proc. FOGS '93, 42-52
-
G. Gottlob. NP Trees and Carnap’s Modal Logic. JACM, 42(2):421-457, 1995. Abstract Proc. FOGS '93, 42-52.
-
(1995)
JACM
, vol.42
, Issue.2
, pp. 421-457
-
-
Gottlob, G.1
-
27
-
-
0002931960
-
The Complexity of Propositional Default Reasoning Under the Stationary Fixed Point Semantics
-
G. Gottlob. The Complexity of Propositional Default Reasoning Under the Stationary Fixed Point Semantics. Information and Computation, 121(1):81-92, 1995.
-
(1995)
Information and Computation
, vol.121
, Issue.1
, pp. 81-92
-
-
Gottlob, G.1
-
28
-
-
0029190785
-
Relativized Logspace and Generalized Quantifiers over Ordered Finite Structures
-
Abstract Proc. IEEE LICS '95
-
G. Gottlob. Relativized Logspace and Generalized Quantifiers over Ordered Finite Structures. J. Symbolic Logic, 1997. Abstract Proc. IEEE LICS '95, 65-78.
-
(1997)
J. Symbolic Logic
, pp. 65-78
-
-
Gottlob, G.1
-
29
-
-
0009392343
-
Second-Order Logic and the Weak Exponential Hierarchies
-
LNCS, Full paper CD-TR 95/80, Information Systems Dept, TU Wien
-
G. Gottlob, N. Leone, and H. Veith. Second-Order Logic and the Weak Exponential Hierarchies. In Proc. MFCS '95, LNCS 969, pp. 66-81, 1995. Full paper CD-TR 95/80, Information Systems Dept, TU Wien.
-
(1995)
Proc. MFCS '95
, vol.969
, pp. 66-81
-
-
Gottlob, G.1
Leone, N.2
Veith, H.3
-
30
-
-
0002041360
-
Logic and the Challenge of Computer Science
-
E. Börger, editor, ch 1. Computer Science Press
-
Y. Gurevich. Logic and the Challenge of Computer Science. In E. Börger, editor, Trends in Theoretical Computer Science, ch 1. Computer Science Press, 1988.
-
(1988)
Trends in Theoretical Computer Science
-
-
Gurevich, Y.1
-
31
-
-
0005467730
-
Zero-One Laws for Modal Logic
-
Abstract Proc. IEEE LICS '92
-
J. Halpern and B. Kapron. Zero-One Laws for Modal Logic. Annals of Pure and Applied Logic, 69:157-193, 1994. Abstract Proc. IEEE LICS '92.
-
(1994)
Annals of Pure and Applied Logic
, vol.69
, pp. 157-193
-
-
Halpern, J.1
Kapron, B.2
-
32
-
-
0010744182
-
Some Remarks on Infinitely Long Formulas
-
Warsaw, Panstwowe Wydawnictwo Naukowe and Pergamon Press
-
L. Henkin. Some Remarks on Infinitely Long Formulas. In Infinitistic Methods, Proc. Symp. on Foundations of Mathematics, pp. 167-183. Warsaw, Panstwowe Wydawnictwo Naukowe and Pergamon Press, 1961.
-
(1961)
Infinitistic Methods, Proc. Symp. on Foundations of Mathematics
, pp. 167-183
-
-
Henkin, L.1
-
34
-
-
0029287977
-
Computing Functions with Parallel Queries to NP
-
B. Jenner and J. Toran. Computing Functions with Parallel Queries to NP. TCS, 141:175-193, 1995.
-
(1995)
TCS
, vol.141
, pp. 175-193
-
-
Jenner, B.1
Toran, J.2
-
35
-
-
0001951331
-
A Catalog of Complexity Classes
-
J. van Leeuwen (ed), ch. 2
-
D. S. Johnson. A Catalog of Complexity Classes. In J. van Leeuwen (ed), Handbook of TCS A, ch. 2, 1990.
-
(1990)
Handbook of TCS
, vol.A
-
-
Johnson, D.S.1
-
36
-
-
38249025494
-
NP[O(log n)]and Sparse Turing-Complete Sets for NP
-
NP[O(log n)]and Sparse Turing-Complete Sets for NP. JCSS, 39:282-298, 1989.
-
(1989)
JCSS
, vol.39
, pp. 282-298
-
-
Kadin, J.1
-
37
-
-
0024020188
-
The Complexity of Optimization Problems
-
M. Krentel. The Complexity of Optimization Problems. JCSS, 36:490-509, 1988.
-
(1988)
JCSS
, vol.36
, pp. 490-509
-
-
Krentel, M.1
-
38
-
-
0003108854
-
Relativization Questions about Logspace Computability
-
R. Ladner and N. Lynch. Relativization Questions about Logspace Computability. Mathematical Systems Theory, 10:19-32, 1976.
-
(1976)
Mathematical Systems Theory
, vol.10
, pp. 19-32
-
-
Ladner, R.1
Lynch, N.2
-
39
-
-
84948987058
-
The Complexity of Iterated Belief Revision
-
LNCS
-
P. Liberatore. The Complexity of Iterated Belief Revision. In Proc. ICDT '97, LNCS 1186, 276-290, 1997.
-
(1997)
Proc. ICDT '97
, vol.1186
, pp. 276-290
-
-
Liberatore, P.1
-
40
-
-
84958789719
-
How Hard is it to Revise a Belief Base? TR № 83, Inst, für Informatik, Univ. Freiburg, Germany, August
-
Belief Change, D. Dubois and H. Prade (eds), to appear
-
B. Nebel. How Hard is it to Revise a Belief Base? TR № 83, Inst, für Informatik, Univ. Freiburg, Germany, August 1996. In: Handbook on Defeasible Reasoning and Uncertainty Management Systems. Volume 2: Belief Change, D. Dubois and H. Prade (eds), to appear.
-
(1996)
Handbook on Defeasible Reasoning and Uncertainty Management Systems
, vol.2
-
-
Nebel, B.1
-
41
-
-
0038877228
-
k-1 closures of NP and other classes
-
k-1 closures of NP and other classes. Information and Computation, 120:55-58, 1995.
-
(1995)
Information and Computation
, vol.120
, pp. 55-58
-
-
Ogihara, M.1
-
42
-
-
84958750187
-
k-1(NP)
-
LNCS
-
k-1(NP). In Proc. STACS '94, LNCS 775, pp. 313-324, 1994.
-
(1994)
Proc. STACS '94
, vol.775
, pp. 313-324
-
-
Ogiwara, M.1
-
43
-
-
85034738925
-
Two Remarks on the Power of Counting
-
LNCS
-
C. Papadimitriou and S. Zachos. Two Remarks on the Power of Counting. In Proc. 6th GI Conf. on TCS, LNCS 145, pp. 269-276, 1983.
-
(1983)
Proc. 6th GI Conf. on TCS
, vol.145
, pp. 269-276
-
-
Papadimitriou, C.1
Zachos, S.2
-
45
-
-
49149147322
-
A Logic for Default Reasoning
-
R. Reiter. A Logic for Default Reasoning. Artificial Intelligence, 13:81-132, 1980.
-
(1980)
Artificial Intelligence
, vol.13
, pp. 81-132
-
-
Reiter, R.1
-
46
-
-
0027294138
-
Logical Characterizations of Bounded Query Classes, I + II
-
I. Stewart. Logical Characterizations of Bounded Query Classes, I + II. Fundamenta Informaticae, 18:65-92 + 93-105, 1993.
-
(1993)
Fundamenta Informaticae
, vol.18
-
-
Stewart, I.1
-
47
-
-
0023467207
-
More Complicated Questions about Maxima and Minima, and Some Closures of NP
-
Abstract Proc. ICALP '86, 434-443
-
K. Wagner. More Complicated Questions about Maxima and Minima, and Some Closures of NP. TCS, 51:53-80, 1987. Abstract Proc. ICALP '86, 434-443.
-
(1987)
TCS
, vol.51
, pp. 53-80
-
-
Wagner, K.1
-
48
-
-
0025507099
-
Bounded Query Classes
-
K. Wagner. Bounded Query Classes. SIAM J. Computing, 19(5):833-846, 1990.
-
(1990)
SIAM J. Computing
, vol.19
, Issue.5
, pp. 833-846
-
-
Wagner, K.1
|