Sciweavers

Share
CORR
2002
Springer

Ultimate approximations in nonmonotonic knowledge representation systems

8 years 8 months ago
Ultimate approximations in nonmonotonic knowledge representation systems
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We show that each lattice operator O has a unique most precise or ultimate approximation. We demonstrate that xpoints of this ultimate approximation provide useful insights into xpoints of the operator O. We apply our theory to logic programming and introduce the ultimate KripkeKleene, well-founded and stable semantics. We show that the ultimate Kripke-Kleene and well-founded semantics are more precise then their standard counterparts We argue that ultimate semantics for logic programming have attractive epistemological properties and that, while in general they are computationally more complex than the standard semantics, for many classes of theories, their complexity is no worse.
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where CORR
Authors Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski
Comments (0)
books