FIXED POINT THEORY FOR COMPLETE T-LATTICE IN LOGIC PROGRAMMING
From MaRDI portal
Publication:5278010
DOI10.17654/FP011030221zbMath1375.06007MaRDI QIDQ5278010
El Miloudi Marhrani, Bouzkoura Khadija
Publication date: 12 July 2017
Published in: JP Journal of Fixed Point Theory and Applications (Search for Journal in Brave)
classical Tarski theoremscomplete \(T\)-lattice fixed point theoremsemi-strictly level-decreasing logic programsVan-Emden Kowalski operator
Complete lattices, completions (06B23) Logic programming (68N17) Generalizations of lattices (06B75)
This page was built for publication: FIXED POINT THEORY FOR COMPLETE T-LATTICE IN LOGIC PROGRAMMING