Approximation Fixpoint Theory – A Unifying Framework for Non-monotonic Semantics Part 2

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Approximation Fixpoint Theory – A Unifying Framework for Non-monotonic Semantics Part 2

Vortrag von Hannes Straß
Motivated by structural similarities in the semantics of Reiter's

default logic and the stable model semantics of logic programming (among others), Denecker, Marek, and Truszczyński set out to isolate these similarities in a purely algebraic setting. The result is now known as approximation fixpoint theory, and allows to study the semantics of the major non-monotonic knowledge representation formalisms in an abstract, uniform framework. After briefly recalling some lattice theory, we will present the main concepts of approximation fixpoint theory, applying it to the case of

logic programming as a running example.

This is the second part of the talk,

Link: https://bbb.tu-dresden.de/b/ali-zgz-l8d-52n