Infinite-Valued Least Model and Game Semantics for Formula-Based and Normal Logic Programs

Beschreibung

We prove that every formula-based logic program has a least infinite-valued model. Moreover, we prove that the game semantics of a normal program P, introduced by Rondogiannis and Wadge, is equal to the well-founded semantics of P, even if the Herbrand universe of P is infinite.

Autor*in

Rainer Lüdecke

Stimmen zu »Infinite-Valued Least Model and Game Semantics for Formula-Based and Normal Logic Programs«

Details

Link teilen