Approximation Fixpoint Theory – A Unifying Framework for Non-monotonic Semantics
From International Center for Computational Logic
Approximation Fixpoint Theory – A Unifying Framework for Non-monotonic Semantics
Talk by Hannes Straß
- Location: Online
- Start: 3. February 2022 at 11:00 am
- End: 3. February 2022 at 12:00 pm
- Event series: Research Seminar Logic and AI
- iCal
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.