On fixed-points of multivalued functions on complete lattices and their application to generalized logic programs

SIAM Journal on Computing

Volumn 38, Issue 5, 2008, Pages 1881-1911

  Straccia, Umberto ^a   Ojeda Aciego, Manuel ^b   Damásio, Carlos V ^c  

^a ISTI CNR   (Italy)

^b UNIVERSITY OF MÁLAGA   (Spain)

^c UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

Complete lattices; Fixed points; Logic programming; Multivalued functions

Indexed keywords

COMPLETE LATTICES; FIXED POINTS; GENERALIZED LOGIC PROGRAM; LOGIC PROGRAMS; MULTIVALUED FUNCTIONS; MULTIVALUED MAPPINGS; MULTIVALUED OPERATOR; POWER SET; SINGLE VALUED FUNCTIONS;

FUNCTIONS;

LOGIC PROGRAMMING;

EID: 84856815860     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070695976     Document Type: Article

References (53)

1. S. Abramsky and A. Jung, Domain theory, in Handbook of Logic in Computer Science, Vol. 3, S. Abramsky, D. Gabbay, and T. S. E. Maibaum, eds., Oxford University Press, Oxford, UK, 1994, pp. 1-168.
2. C. Avramescu, A fixed-point theorem for multivalued mappings, Electron. J. Qual. Theory Differ. Equ., 10 (2004), pp. 1-10.
3. N. D. Belnap, A useful four-valued logic, in Modern Uses of Multiple-Valued Logic, G. Epstein and J. Michael Dunn, eds., D. Reidel, Dordrecht, The Netherlands, 1977, pp. 5-37.
4. M. Benado, Les ensembles partiellement ordonnés et le théorème de raffinement de Schreier, II. Théorie des multistructures, Czech. Math. J., 5 (1955), pp. 308-344.
5. G. Birkhoff, Lattice Theory, American Mathematical Society, Providence, RI, 1973.
6. F. Echenique, A short and constructive proof of Tarski's fixed-point theorem, Internat. J. Game Theory, 33 (2005), pp. 215-218. (Pubitemid 43293098)
7. H. Egli, A Mathematical Model for Nondeterministic Computations, Technological University, Zürich, Zürich, Switzerland, 1975.
8. N. Francez, C. A. R. Hoare, D. J. Lehmann, and W. P. de Roever, Semantics of nondeterminism, concurrency, and communication, J. Comput. System Sci., 19 (1979), pp. 290-308.
9. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Gener. Computing, 9 (1991), pp. 365-386.
10. L. Górniewicz, Topological Fixed Point Theory of Multivalued Mappings, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1999.
11. C. A. Gunter and D. S. Scott, Semantic domains, in Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 633- 674.
12. J. Hillas, Fixed Points Theorems, http://yoda.eco.auckland.ac.nz/ ~jhillas/616.781/fpb 01.pdf (2001).
13. P. Hitzler, Default reasoning over domains and concept hierarchies, in Proceedings of the 27th German Conference on Artificial Intelligence (KI-04), Lecture Notes in Artificial Intelligence 3238, Springer, Berlin, 2004, pp. 351-365.
14. P. Hitzler and A. K. Seda, The fixed-point theorems of priess-crampe and ribenboim in logic programming, in Proceedings of the 1999 Valuation Theory Conference, Fields Institute Communications Series 23, American Mathematical Society, Providence, RI, 1999, pp. 219-235.
15. P. Hitzler and A. K. Seda, Multivalued mappings, fixed-point theorems and disjunctive databases, in Proceedings of the 3rd Irish Workshop on Formal Methods, Galway, Eire, 1999.
16. P. Hitzler and A. K. Seda, Some issues concerning fixed points in computational logic: Quasi-metrics, multivalued mappings, and the Knaster-Tarski theorem, Topology Proc., 24 (1999), pp. 223-250.
17. P. Hitzler and A. K. Seda, Generalized metrics and uniquely determined logic programs, Theoret. Comput. Sci., 305 (2003), pp. 187-219.
18. C. A. R. Hoare, Communicating sequential processes, Comm. ACM, 21 (1978), pp. 666-677.
19. S. Kakutani, A generalization of Brouwer's fixed-point theorem, Duke Math. J., 8 (1941), pp. 457-459.
20. M. A. Khamsi, V. Kreinovich, and D. Misane, A new method of proving the existence of answer sets for disjunctive logic programs: A metric fixed point theorem for multivalued maps, in Proceedings of theWorkshop on Logic Programming with Incomplete Information, Vol. 32, Vancouver, BC, Canada, 1993, pp. 58-73.
21. M. A. Khamsi and D. Misane, Disjunctive signed logic programs, Fund. Inform., 32 (1996), pp. 349-357. (Pubitemid 127556752)
22. M. A. Khamsi and D. Misane, Fixed point theorems in logic programming, Ann. Math. Artificial Intell., 21 (1997), pp. 231-243. (Pubitemid 127718441)
23. I.-S. Kim, Fixed points of condensing multivalued maps in topological vector spaces, Fixed Point Theory Appl., 2 (2004), pp. 107-112.
24. A. Kirk and B. Sims, Handbook of Metric Fixed Point Theory, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001.
25. P. Knijnenburg, Algebraic Domains, Chain Completion and the Plotkin Powerdomain Construction, Technical report RUU-CS-93-03, Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands, 1993.
26. J. W. Lloyd, Foundations of Logic Programming, Springer, Heidelberg, 1987.
27. J. Lobo, J. Minker, and A. Rajasekar, Foundations of Disjunctive Logic Programs, MIT Press Series in Logic Programming, Ellis Horwood, New York, 1992.
28. Y. Loyer and U. Straccia, Epistemic foundation of stable model semantics, J. Theory Practice Logic Program., 6 (2006), pp. 355-393. (Pubitemid 43938433)
29. J. Martínez, G. Gutiérrez, I. P. de Guzmán, and P. Cordero, Generalizations of lattices via non-deterministic operators, Discrete Math., 295 (2005), pp. 107-141. (Pubitemid 40654806)
30. J. Medina, M. Ojeda-Aciego, and J. Ruiz-Calviño, Fuzzy logic programming via multilattices, Fuzzy Sets and Systems, 158 (2007), pp. 674-688. (Pubitemid 46187290)
31. R. Milner, An approach to the semantics of parallel programs, in Proceedings of the Convegno di Informatica Theorica, Istituto di Elaborazione dell'Informazione, Pisa, 1973.
32. J. Minker and A. Rajasekar, A fixpoint semantics for disjunctive logic programs, J. Logic Program., 9 (1990), pp. 45-74. (Pubitemid 20721928)
33. V. Orey, Fixed points for correspondences with values in a partially ordered set and extended supermodular games, J. Math. Econom., 25 (1996), pp. 345-354. (Pubitemid 126163854)
34. S. Park, New versions of the Fan-Browder fixed point theorem and existence of economic equilibria, Fixed Point Theory Appl., 2 (2004), pp. 149-158.
35. A. Petrusel, Fixed points for multifunctions on generalized metric spaces with applications to a multivalued Cauchy problem, Comment. Math. Univ. Carolinae, 38 (1997), pp. 657-663.
36. G. D. Plotkin, A powerdomain construction, SIAM J. Comput., 5 (1976), pp. 452-487.
37. G. D. Plotkin, Pisa Notes (On Domain Theory), Department of Computer Science, University of Edinburgh, Edinburgh, 1983. Available online at http://homepages.inf.ed.ac.uk/gdp/publications/Domains.ps
38. S. Priess-Crampe and P. Ribenboim, Ultrametric spaces and logic programming, J. Logic Program., 42 (2000), pp. 59-70. (Pubitemid 32081818)
39. W. C. Rounds and G.-Q. Zhang, Clausal logic and logic programming in algebraic domains, Inform. Comput., 171 (2001), pp. 183-200.
40. A. K. Seda, Topology and the semantics of logic programs, Fund. Inform., 24 (1995), pp. 359-386.
41. A. K. Seda, Quasi-metrics and the semantics of logic programs, Fund. Inform., 29 (1997), pp. 97-117. (Pubitemid 127718749)
42. D. Seipel, J. Minker, and C. Ruiz, Model generation and state generation for disjunctive logic programs, J. Logic Program., 32 (1997), pp. 49-69.
43. N. Shahzad and A. Lone, Fixed points of multimaps which are not necessarily nonexpansive. Theorem and existence of economic equilibria, Fixed Point Theory Appl., 2 (2005), pp. 169-176.
44. M. B. Smyth, Power domains, J. Comput. System Sci., 16 (1978), pp. 23-36.
45. A. Stouti, A generalized Amman's fixed point theorem and its application to Nash equilibrium, Acta Math. Acad. Paedagog. Nyházi. (N.S.), 21 (2005), pp. 107-112. (Pubitemid 41305609)
46. U. Straccia, Managing uncertainty and vagueness in description logics, logic programs and description logic programs, in Reasoning Web, 4th International Summer School, Tutorial Lectures, Lecture Notes in Comput. Sci. 5224, Springer-Verlag, Berlin, New York, 2008, pp. 54-103.
47. A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math., 5 (1955), pp. 285-309.
48. P. Vojtáš, Fuzzy logic programming, Fuzzy Sets and Systems, 124 (2001), pp. 361-370. (Pubitemid 32951443)
49. L. E. Ward, Jr., A fixed-point theorem for multi-valued functions, Pacific J. Math., 8 (1958), pp. 921-927.
50. X. Wu, A new fixed point theorem and its applications, Proc. Amer. Math. Soc., 125 (1997), pp. 1779-1788.
51. Z. Wu, A note on fixed point theorems for semi-continuous correspondences on [0,1], Proc. Amer. Math Soc., 126 (1998), pp. 3061-3064.
52. G.-Q. Zhang and W. C. Rounds, Semantics of logic programs and representation of Smyth powerdomain, in Domains and Processes: Proceedings of the 1st International Symposium on Domain Theory, K. Keimel et al., eds., Kluwer, Dordrecht, 1999, pp. 151-181.
53. L. Zhou, The set of Nash equilibria of a supermodular game is a complete lattice, Games Econom. Behav., 7 (1994), pp. 295-300.