Subscribe Now Subscribe Today
Research Article
 

Extended Stable Models for Logical Programs with Many Negations



Victor Felea
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail
ABSTRACT

The family of stable models for a logic program with one negation was studied by Melvin Fitting. We introduce extended stable model semantics of logic programs with many negations, which natural extends the notion of stable model semantics for logic programs with one negation. We use the notion of bilattice with two ordering which defines the structure of the family of stable models. The first one is called knowledge ordering, the second one is called degree of truth. For a vector of valuations in a billatice B, we define a pseudovaluation and an operator associated to a program . We also consider the notion of i-model for a program . For an operator we define a fixed-point iteration. This iteration is applied to the operator associated to and produces so-called extended stability operators. When the fixed-point iteration can be applied by n times, where n is the number of negations, then every fixed point of the last operator is an extended stable valuation of .

Services
Related Articles in ASCI
Similar Articles in this Journal
Search in Google Scholar
View Citation
Report Citation

 
  How to cite this article:

Victor Felea , 2002. Extended Stable Models for Logical Programs with Many Negations. Journal of Applied Sciences, 2: 980-984.

DOI: 10.3923/jas.2002.980.984

URL: https://scialert.net/abstract/?doi=jas.2002.980.984

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 24-27, 1990, Kaiserslautern, Germany, pp: 72-86.

2:  Fages, F., 1990. A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. Proceedings of the 7th Logic Programming Symposium, (LPS'90), MIT Press, Cambridge, MA., pp: 442-458.

3:  Fitting, M., 1993. Family of stable models. J. Logic Programm., 17: 197-225.
Direct Link  |  

4:  Melvin, F., 1991. Well-founded semantics, generalized. Proceedings of the International Symposium on Logic Programming, August 26-28, 1991, Passau, Germany, pp: 71-88.

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: 1070-1080.

6:  Kifer, M., 1998. On the decidability and axiomatization of query finiteness in deductive database. J. ACM, 45: 588-633.
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: 598-613.

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: 459-477.

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: 573-586.

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 5-7, 1996, Clermont-Ferrand, France, pp: 49-63.

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 6-9, 1991, Rostock, Germany, pp: 357-371.

©  2021 Science Alert. All Rights Reserved