-
2
-
-
84934529789
-
-
Bidoit, N. and Froidevaux, C., “General Logical Databases and Programs: Default Logic Semantics and Stratification,”Journal of Information and Computation, 1988. In print.
-
-
-
-
3
-
-
84934529792
-
-
Bidoit, N. and Hull, R., “Positivism vs. Minimalism in Deductive Databases,” in Proceedings of the Symposium on Principles of Database Systems, Cambridge, Mass., ACM SIGACT-SIGMOD, pp. 123–132, 1986.
-
-
-
-
5
-
-
84934529793
-
-
Bry, F., “Logic Programming as Constructivism: A Formalization and Its Application to Databases,” in Proceedings of the Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD, pp. 34–50, 1989.
-
-
-
-
7
-
-
84934529762
-
-
Gelfond, M., “On Stratified Autoepistemic Theories,” in Proceedings AAAI-87, Los Altos, CA, American Association for Artificial Intelligence, Morgan Kaufmann, pp. 207–211, 1987.
-
-
-
-
9
-
-
0001119421
-
The Stable Model Semantics for Logic Programming
-
R., Kowalski, K., Bowen, Association for Logic Programming, MIT Press, Cambridge, Mass.
-
(1988)
Proceedings of the Fifth Logic Programming Symposium
, pp. 1070-1080
-
-
Gelfond, M.1
Lifschitz, V.2
-
10
-
-
84934529758
-
-
Gelfond, M. and Lifschitz, V., “Logic Programs with Classical Negation,”Research Report, UT El Paso and Stanford University, 1989.
-
-
-
-
12
-
-
84934529761
-
-
Horty, J., Thomason, R. and Touretzky, D., “A Skeptical Theory of Inheritance in Nonmonotonic Semantic Nets,” in Proceedings AAAI-87, Los Altos, CA, American Association for Artificial Intelligence, Morgan Kaufmann, 1987.
-
-
-
-
13
-
-
0002163565
-
Hard Problems for Simple Default Logics
-
R., Brachman, H., Leveque, R., Reiter, Morgan Kaufmann, Toronto, Canada
-
(1989)
Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning (KR’ 89)
, pp. 189-197
-
-
Kautz, H.A.1
Selman, B.2
-
17
-
-
84934529760
-
-
Morris, P. H., “Autoepistemic Stable Closures and Contradiction Resolution,” in Proceedings of the Second Workshop on Non-Monotonic Reasoning, Munich, July 1988, pp. 60–73, 1988.
-
-
-
-
18
-
-
84934529755
-
-
Marek, W. and Truszczynski, M., “Autoepistemic Logic,”Research Report, University of Kentucky, 1988.
-
-
-
-
20
-
-
84934529754
-
-
Przymusinska, H. and Przymusinski, T. C., “Translating Non-Monotonic Formalisms into Logic Programs,”Research Report, University of Texas at El Paso, 1991.
-
-
-
-
22
-
-
84934529757
-
-
Przymusinski, T. C., “Every Logic Program Has a Natural Stratification and an Iterated Fixed Point Model,” in Proceedings of the Eighth Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD, pp. 11–21, 1989.
-
-
-
-
23
-
-
8644279450
-
Non-Monotonic Formalisms and Logic Programming
-
G., Levi, M., Martelli, Association for Logic Programming, MIT Press, Lisobon, Portugal, Cambridge, Mass.
-
(1989)
Proceedings of the Sixth International Logic Programming Conference
, pp. 655-674
-
-
Przymusinski, T.C.1
-
27
-
-
84934529753
-
-
Przymusinski, T. C., “Semantics of Disjunctive Logic Programs and Deductive Databases,” in Proceedings of the Second International Conference on Deductive and Object-Oriented Databases (DOOD’91), Munich, Germany, 1991, Springer-Verlag (In print.), 1991.
-
-
-
-
28
-
-
84934529752
-
-
Przymusinski, T. C., “Three-Valued Non-Monotonic Formalisms and Semantics of Logic Programs,”Journal of Artificial Intelligence, 1991 (In print. Extended abstract appeared in: Przymusinski, T. C., “Three-Valued Non-Monotonic Formalisms and Logic Programming,” in Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning KR’89) (R. Brachman, H. Leveque and R. Reiter, eds.), Toronto, Canada, Morgan Kaufmann, pp. 341–348, 1989.
-
-
-
-
29
-
-
84934529751
-
-
Przymusinski, T. C., “Well-Founded Completions of Logic Programs,” in Proceedings of the Eighth International Logic Programming Conference, Paris, France, Cambridge, Mass., 1991. Association for Logic Programming, MIT Press (In print).
-
-
-
-
30
-
-
84934529750
-
-
Przymusinski, T. C. and Warren, D. S., “Well-Founded Semantics: Theory and Implementation,”Research Report, UT El Paso and SUNY at Stony Brook, 1991. (in preparation).
-
-
-
-
31
-
-
84934529749
-
-
Ross, K., “A Procedural Semantics for Well-Founded Negation in Logic Programs,” in Proceedings of the Eighth Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD, pp. 22–33, 1989.
-
-
-
-
32
-
-
84934529748
-
-
Ross, K., “The Well-Founded Semantics for Disjunctive Logic Programs,” in Proceedings of the First International Conference on Deductive and Object Oriented Databases, pp. 352–369, 1989.
-
-
-
-
34
-
-
84934529747
-
-
Van Gelder, A., “The Alternating Fixpoint of Logic Programs with Negation,” in Proceedings of the Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD, pp. 1–10, 1989.
-
-
-
-
36
-
-
84934529746
-
-
Van Gelder, A., Ross, K. A. and Schlipf, J. S., “The Well-Founded Semantics for General Logic Programs,”Journal of the ACM, 1990 (to appear). Preliminary abstract appeared in Seventh ACM Symposium on Principles of Database Systems, March 1988, pp. 221–230, 1988.
-
-
-
-
37
-
-
84934529745
-
-
Warren, D. S., “The XWAM: A Machine That Integrates Prolog and Deductive Database Query Evaluation,”Technical Report, #25, SUNY at Stony Brook, 1989.
-
-
-
|