FIXED POINT THEORY FOR COMPLETE T-LATTICE IN LOGIC PROGRAMMING
In this work, we define semi-strictly level-decreasing logic programs and investigate the existence of supported model sets for this class of programs. Our main argument is based on an analogue to complete T-lattice fixed point theorem which we prove for monotone mappings.
semi-strictly level-decreasing logic programs, complete T-lattice fixed point theorem, Van-Emden Kowalski operator, classical Tarski theorems.
