ABSTRACT
We introduce the notion of a lexicographic lattice structure, namely a lattice whose elements can be viewed as stratified entities and whose ordering relation compares elements in a lexicographic manner with respect to their strata. These lattices arise naturally in many non-monotonic formalisms, such as normal logic programs, higher-order logic programs with negation, and boolean grammars. We consider functions over such lattices that may overall be non-monotonic, but retain a restricted form of monotonicity inside each stratum. We demonstrate that such functions always have a least fixed point which is also their least pre-fixed point. Moreover, we prove that the sets of pre-fixed and post-fixed points of such functions, are complete lattices. For the special case of a trivial lexicographic lattice structure whose elements essentially consist of a unique stratum, our theorem gives as a special case the well-known Knaster-Tarski fixed point theorem. Moreover, our work considerably simplifies and extends recent results on non-monotonic fixed point theory, providing in this way a useful and convenient tool in the semantic investigation of non-monotonic formalisms.
- Samson Abramsky and Achim Jung. Domain theory. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science III. Clarendon Press, 1994.Google Scholar
- Bloom, S. L. and Ésik, Z. Iteration Theories - The Equational Logic of Iterative Processes. Springer, EATCS Monographs on Theoretical Computer Science, 1993.Google Scholar
- Arnaud Carayol and Zoltán Ésik. An analysis of the equational properties of the well-founded fixed point. In Chitta Baral, James P. Delgrande, and Frank Wolter, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016, pages 533--536. AAAI Press, 2016.Google Scholar
- Angelos Charalambidis, Zoltán Ésik, and Panos Rondogiannis. Minimum model semantics for extensional higher-order logic programming with negation. TPLP, 14(4-5):725--737, 2014.Google ScholarCross Ref
- Henry Crapo. Lexicographic partial orders. Transactions of The American Mathematical Society, 243:37--37, 09 1978.Google ScholarCross Ref
- B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 2 edition, 2002.Google Scholar
- Marc Denecker, Victor Marek, and Mirosław Truszczyński. Approximations, Stable Operators, Well-Founded Fixpoints and Applications in Nonmonotonic Reasoning, pages 127--144. In: Logic-Based Artificial Intelligence. The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, MA, 2000.Google Scholar
- Marc Denecker, Victor W. Marek, and Miroslaw Truszczynski. Ultimate approximation and its application in nonmonotonic knowledge representation systems. Inf. Comput., 192(1):84--121, 2004.Google ScholarDigital Library
- Zoltán Ésik. Equational properties of stratified least fixed points (extended abstract). In Valeria de Paiva, Ruy J. G. B. de Queiroz, Lawrence S. Moss, Daniel Leivant, and Anjolina Grisi de Oliveira, editors, Logic, Language, Information, and Computation - 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings, volume 9160 of Lecture Notes in Computer Science, pages 174--188. Springer, 2015.Google Scholar
- Zoltán Ésik and Panos Rondogiannis. Theorems on pre-fixed points of non-monotonic functions with applications in logic programming and formal grammars. In Ulrich Kohlenbach, Pablo Barceló, and Ruy J. G. B. de Queiroz, editors, Logic, Language, Information, and Computation - 21st International Workshop, WoLLIC 2014, Valparaíso, Chile, September 1-4, 2014. Proceedings, volume 8652 of Lecture Notes in Computer Science, pages 166--180. Springer, 2014.Google Scholar
- Zoltán Ésik and Panos Rondogiannis. A fixed point theorem for nonmonotonic functions. Theor. Comput. Sci., 574:18--38, 2015.Google ScholarDigital Library
- Melvin Fitting. Fixpoint semantics for logic programming a survey. Theor. Comput. Sci., 278(1-2):25--51, 2002.Google ScholarDigital Library
- Allen Van Gelder, Kenneth A. Ross, and John S. Schlipf. The well-founded semantics for general logic programs. J. ACM, 38(3):620--650, 1991.Google ScholarDigital Library
- Vassilis Kountouriotis, Christos Nomikos, and Panos Rondogiannis. Well-founded semantics for boolean grammars. Inf. Comput., 207(9):945--967, 2009.Google ScholarDigital Library
- John W. Lloyd. Foundations of Logic Programming. Springer Verlag, 1987.Google ScholarDigital Library
- Alexander Okhotin. Boolean grammars. Inf. Comput., 194(1):19--48, 2004.Google ScholarCross Ref
- Teodor C. Przymusinski. Every logic program has a natural stratification and an iterated least fixed point model. In Avi Silberschatz, editor, Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 29-31, 1989, Philadelphia, Pennsylvania, USA, pages 11--21. ACM Press, 1989.Google ScholarDigital Library
- Panos Rondogiannis and William W. Wadge. Minimum model semantics for logic programs with negation-as-failure. ACM Trans. Comput. Log., 6(2):441--467, 2005.Google ScholarDigital Library
- Joseph E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge, MA, USA, 1977.Google ScholarDigital Library
- Alfred Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math., 5(2):285--309, 1955.Google ScholarCross Ref
- R. D. Tennent. Principles of Programming Languages. Prentice Hall PTR, USA, 1981.Google Scholar
- Maarten H. van Emden and Robert A. Kowalski. The semantics of predicate logic as a programming language. J. ACM, 23(4):733--742, 1976.Google ScholarDigital Library
Index Terms
- A Fixed Point Theorem on Lexicographic Lattice Structures
Recommendations
Skolemization and Herbrand theorems for lattice-valued logics
AbstractSkolemization and Herbrand theorems are obtained for first-order logics based on algebras with a complete lattice reduct and operations that are monotone or antitone in each argument. These lattice-valued logics, defined as consequence ...
The complexity of determining the uniqueness of Tarski's fixed point under the lexicographic ordering
WINE'10: Proceedings of the 6th international conference on Internet and network economicsThe well-known Tarski's fixed point theorem asserts that an increasing mapping from a complete lattice into itself has a fixed point. This theorem plays an important role in the development of supermodular games for economic analysis. Let C be a finite ...
Lattice pseudoeffect algebras as double residuated structures
Special Issue on Evolutionary Fuzzy SystemsPseudoeffect algebras are partial algebraic structures which are non-commutative generalizations of effect algebras. The main result of the paper is a characterization of lattice pseudoeffect algebras in terms of so-called pseudo Sasaki algebras. In ...
Comments