-
3
-
-
0031166270
-
Computing circumscription revisited. A reduction algorithm
-
Doherty, P., Łukaszewicz, W., Szałas, A. (1997) Computing Circumscription Revisited. A Reduction Algorithm, Journal of Automated Reasoning, 18, 3, 297-336 .
-
(1997)
Journal of Automated Reasoning
, vol.18
, Issue.3
, pp. 297-336
-
-
Doherty, P.1
Łukaszewicz, W.2
Szałas, A.3
-
4
-
-
0030383468
-
A reduction result for circumscribed semi-horn formulas
-
Doherty, P., Łukaszewicz, W., Szałas, A. (1996) A Reduction Result for Circumscribed Semi-Horn Formulas, Fundamenta Informaticae, 28, 3-4, 261-272.
-
(1996)
Fundamenta Informaticae
, vol.28
, Issue.3-4
, pp. 261-272
-
-
Doherty, P.1
Łukaszewicz, W.2
Szałas, A.3
-
5
-
-
0040880587
-
General domain circumscription and its effective reductions
-
Doherty, P., Łukaszewicz, W., Szałas, A. (1998) General Domain Circumscription and its Effective Reductions, Fundamenta Informaticae, 36, 1, 23-55
-
(1998)
Fundamenta Informaticae
, vol.36
, Issue.1
, pp. 23-55
-
-
Doherty, P.1
Łukaszewicz, W.2
Szałas, A.3
-
6
-
-
0033354698
-
Declarative PTIME queries for relational databases using quantifier elimination
-
Doherty, P., Łukaszewicz, W., Szałas, A. (1999) Declarative PTIME Queries for Relational Databases using Quantifier Elimination, Journal of Logic and Computation, 9, 739-761.
-
(1999)
Journal of Logic and Computation
, vol.9
, pp. 739-761
-
-
Doherty, P.1
Łukaszewicz, W.2
Szałas, A.3
-
8
-
-
0022500426
-
Relational queries computable in polynomial time
-
Immerman, N. (1986) Relational Queries Computable in Polynomial Time, Information and Control, 68, 86-104.
-
(1986)
Information and Control
, vol.68
, pp. 86-104
-
-
Immerman, N.1
-
9
-
-
0039694467
-
-
Memo AIM-312, Stanford University
-
McCarthy, M., Sato, M., Hayashi, T., Igarashi, S. (1978) On the Model Theory of Knowledge, Stanford Artificial Intelligence Laboratory, Memo AIM-312, Stanford University.
-
(1978)
On the Model Theory of Knowledge, Stanford Artificial Intelligence Laboratory
-
-
McCarthy, M.1
Sato, M.2
Hayashi, T.3
Igarashi, S.4
-
10
-
-
0040880586
-
A fixpoint approach to second-order quantifier elimination with applications to correspondence theory
-
E. Orłowska (ed.), Physica Verlag
-
Nonnengart, A., Szałas, A. (1998) A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory, in: Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, E. Orłowska (ed.), Physica Verlag, 89-108.
-
(1998)
Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa
, pp. 89-108
-
-
Nonnengart, A.1
Szałas, A.2
-
12
-
-
0023410891
-
Proving self-utterances
-
Miller, M., Perlis, D. (1987) Proving Self-Utterances, Journal of Automated Reasoning (3)3, 329-338.
-
(1987)
Journal of Automated Reasoning
, vol.3
, Issue.3
, pp. 329-338
-
-
Miller, M.1
Perlis, D.2
|