참고문헌
- K. R. Apt, et. al., Towards a Theory of Declarative Knowledge, In J. Minker, ed., 'Foundation of Deductive Data bases and Logic Programming,' pp.193 216, Los Altos, CA : Morgan Kaufman, 1988
- P. Atzeni, S. Ceri, S. Paraboschi, R. Torlone, 'Database Systems - Concepts, Languages and Architectures,' McGraw Hill Book Company 1999
- F. Buccafurri, et. al., 'Stable Models and Their Computation for Logic Programming with Inheritance and true Negation,' Journal of Logic Programming, 27(1) : 5-44, 1996 https://doi.org/10.1016/0743-1066(95)00076-3
- M. Cadoli, and M. Schaerf, 'A survey and Complexity Results for Non-Monotonic Logics,' Journal of Logic Programming, 17 : 127-160, 1993 https://doi.org/10.1016/0743-1066(93)90029-G
- S. Chun, et. al., Succinct Model Semantics: 'A Simple Model for inclusive interpretations. Symposium of Applied Computing,' pp.39 44, 1998 https://doi.org/10.1145/330560.330567
- M. Gelfond and V. Lifschitz, 'The Stable Model Semantics for Logic Programming,' In Proceedings, 5th International Conference and Symposium on Logic Programming, pp. 1070 1080, 1988
- Q. Kong and M. H. Williams, 'Evaluating Different Strategies for Handling Incomplete Information in a Logic Database,' In T. Dodds, Owens and S. Torrence, eds., Expanding the Horizons Workshop, pp.124-144, Intellect book, Oxford, 1990
- Q. Kong, et. al., 'The Indefinite Closed World Assumption,' Data & Knowledge Engineering, 12 : 297-311, 1994 https://doi.org/10.1016/0169-023X(94)90030-2
- J. L. Lassez and M. J. Maher, 'Optimal Fixedpoints of Logic Programs,' Theoretical Computer Science, 39: 15 25, 1985 https://doi.org/10.1016/0304-3975(85)90128-8
- Jeong Oog Lee, Doo Kwon Baik, 'Semantic Integration of Databases Using Linguistic Knowledge,' Australian Joint Conference on Artificial Intelligence, 72-83, 1999
- Marco-schaerf, 'Negation and Minimality in Disjunctive Databases,' Journal of Logic Programming, 23(1) : 63 86, 1995 https://doi.org/10.1016/0743-1066(94)00026-3
- J. Minker, 'On Indefinite Databases and the Closed World Assumption,' In Proceedings of 6th Conference on Auto mated Deduction, pp.292-308, Springer-Verlag, 1982 https://doi.org/10.1007/BFb0000066
- T. C. przymusinski, 'On the Declarative Sementics of Deductive Databases and Logic Programs,' In J. Minker, ed., Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, California, pp. 193-216, 1988
- T. C. przymusinski, 'Perfect Model Semantics,' In Proceedings of the 5th International Conference and Symposium on Logic Programming(Seattle, USA), pp.1081-1096, 1988
- R. Ramakrishnan and J. D. Ullman, 'A Survey of Deductive Database Systems,' Journal of Logic Programming, 23(2) : 125 150, 1995 https://doi.org/10.1016/0743-1066(94)00039-9
- R. Reiter, On Closed World Databases, 'In Gallaire and Minker,' eds., Logic and Databases, pp.55-76, Plenum Press, New York, 1978
- K. Ross, 'Well Founded Semantics for Disjunctive Logic Databases,' In Proc. Int. Conf. on Object Oriented and Deductive Databases, pp.352-369, 1989
- K. Ross, 'The Well-founded Semantics for Disjunctive Logic Programs,' In W. Kim, J. M. Nicolas, and S. Nishio eds., Deductive and Object-Oriented Databases, pp.385-402, Elsevier Science Publishers, B.V., Korth Holland, 1990
- C. Sakama, 'Possible Model Semantics for Disjunctive Databases,' In Proc. Int. Conf. On Object Oriented and Deductive Databases, pp.369-383, 1989
- C. Sakarna and K. Inoue, 'An alternative approach to the Semantics of Disjunctive Logic Programs and Deductive Databases,' Journal of Automated Reasoning, 13 : 145-172, 1994 https://doi.org/10.1007/BF00881915
- C. Sakarna, K. Inoue, 'Paraconsistent Stable Semantics for Extended Disjunctive Programs,' Journal of Logic and Computation 5(3) : pp.265-285, 1995 https://doi.org/10.1093/logcom/5.3.265
- J. S. Schlipf, 'Formalizing a Logic for Logic Programming,' Annals Mathematics and Artificial Intelligence, 5 : 279-302, 1992 https://doi.org/10.1007/BF01543479
- J. S. Schlipf, 'Complexity and Undecidability results in Logic Programming,' Annals Mathematics and Artificial Intelligence, 15 : 257 299, 1995 https://doi.org/10.1007/BF01536398
- H. Seki and H. Itoh, 'A Query Evaluation Method for Stratified Programs under the Extended CWA,' Proc. 5th Conf. and Symp, On Logic Programming, (Kowalski and Bowen, eds.), MIT Press, 1988
- A. Van Gelder, et. al., 'Unfounded Sets and Well-founded Semantics for General Logic Programs,' In Proceedings of 7th ACM Symposium on Principles of Database Systems, pp.221 230, 1988 https://doi.org/10.1145/308386.308444
- A. Van Gelder, et. al, 'The Well-Founded Semantics for General Logic Programs,' Journal of the ACM, 38(3): 620 650, 1991 https://doi.org/10.1145/116825.116838
- A. Yahya, and L. J. Henschen, 'Deduction in Non horn Databases,' Journal of Automated Reasoning, 1 : 141-160, 1985 https://doi.org/10.1007/BF00244994
- J. You and L. Yuan, 'On the Equivalence of Semantics for Normal Logic Programs,' Journal of Logic Programming, 22(3) : pp.211-222, 1995 https://doi.org/10.1016/0743-1066(94)00023-Y