Fixed point theorems in logic programming

Annals of Mathematics and Artificial Intelligence

Volumn 21, Issue 2-4, 1997, Pages 231-243

  Khamsi, Mohamed A ^a   Misane, Driss ^b  

^a UNIVERSITY OF TEXAS AT EL PASO   (United States)

^b FACULTÉ DES SCIENCES   (Morocco)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26444483998     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018969519807     Document Type: Article

References (11)

1. C.R. Baral and V.S. Subrahmanian, Stable and extension class theory for logic programs and default logics, Journal of Automated Reasoning 8 (1992) 345-366.
2. F. Fages, Consistency of Clark's completion and existence of stable models, Journal of Methods of Logic in Computer Science 1 (1994) 51-60.
3. M. Fitting, Metric methods, three examples and a theorem, Journal of Logic Programming (1993), to appear.
4. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Logic Programming: Proceedings of the 5th Int. Conference and Symposium, eds. R. Kowalski and K. Bowen (1988) pp. 1070-1080.
5. J. Kelley, General Topology (Van Nostrand, Princeton, NJ, 1955).
6. K. Kunen, Signed data dependencies in logic programs, Journal of Logic Programming 7(3) (1989) 231-245.
7. J.W. Loyd, Foundations of Logic Programming (Springer-Verlag, New York, 1987).
8. A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Math. 5 (1955) 285-309.
9. H. Turner, Signed logic programs, in: Logic Programming: Proc. of the 1994 Int. Symposium, ed. M. Bruynooghe (MIT Press, 1994) pp. 61-75.
10. M.A. Khamsi, D. Misane and V. Kreinovitch, A new method of proving the existence of answer sets for disjunctive logic programs, in: Proc. ILPS'93 Workshop on Logic Programming with Incomplete Information, eds. C. Baral and M. Gelfond (1993).
11. M.A. Khamsi and D. Misane, Disjunctive signed logic programs, Preprint.