
Research Article


Extended Stable Models for Logical Programs with Many Negations 

Victor Felea



ABSTRACT







REFERENCES 
1: Da Costa, N.C.A., L.J. Henschen, J.J. Lu and V.S. Subrahmanian, 1990. Automatic theorem proving in paraconsistent logic: Theory and implementation. Proceedings of the 10th International Conference on Automated Deduction, July 2427, 1990, Kaiserslautern, Germany, pp: 7286.
2: Fages, F., 1990. A new fixpoint semantics for general logic programs compared with the wellfounded and the stable model semantics. Proceedings of the 7th Logic Programming Symposium, (LPS'90), MIT Press, Cambridge, MA., pp: 442458.
3: Fitting, M., 1993. Family of stable models. J. Logic Programm., 17: 197225. Direct Link 
4: Melvin, F., 1991. Wellfounded semantics, generalized. Proceedings of the International Symposium on Logic Programming, August 2628, 1991, Passau, Germany, pp: 7188.
5: Gelfond, M. and V. Lipschitz, 1988. The stable model semantics for logic programming. Proceedings of the 5th International Conference on Logic Programming, (ICLP'88), MIT Press, Cambridge, MA., pp: 10701080.
6: Kifer, M., 1998. On the decidability and axiomatization of query finiteness in deductive database. J. ACM, 45: 588633. Direct Link 
7: Kowalski, R. and F. Sadri, 1990. Logic programs with exceptions. Proceedings of the 7th International Conference and Symposium on Logic Programming, (ICSLP'90), MIT Press, Cambridge, MA., pp: 598613.
8: Przymusinski, T., 1990. Extended stable semantics for normal and disjunctive programs. Proceedings of the 7th International Conference on Logic Programming, (ICLP'90), MIT Press, Cambridge, MA., pp: 459477.
9: Rajasekar, A. and J. Minker, 1989. A stratification semantics for general disjunctive programs. Proceedings of the North American Conference on Logic Progrmming, (NACLP'89), MIT Press, Cambridge, MA., pp: 573586.
10: Spyratos, N. and D. Stamate, 1996. Bases de donnees avec informations incertaines, semantique et mises a jour. Proceedings of the Cinquiemes Journees Francophones de Programmation Logique et Programmation par Contraintes, June 57, 1996, ClermontFerrand, France, pp: 4963.
11: Gerd, W., 1991. A database needs two kinds of negation. Proceedings of the 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, May 69, 1991, Rostock, Germany, pp: 357371.



