Inductive Tight Semantics for Logic Programs

Luís Moniz Pereira, Alexandre Miguel Pinto

Research output: Chapter in Book/Report/Conference proceedingChapter


The Gelfond-Lifschitz operator fixed-point requirement by Stable Models induces asymmetry in dealing with Even Loops and Odd Loops Over Negation. We introduce a 2-valued semantics for Normal Logic Programs — the Inductive Tight semantics (ITS) — that generalizes SM semantics by dealing uniformly with Even and Odd loops. ITS conservatively extends the SM semantics, enjoys relevance and cumulativity, guarantees model existence, and respects the Well-Founded Model. The IT semantics relies on Layering, a generalization of Stratification, and is inductively defined on such layering: each model for a given layer must comply with some model for the whole set of layers below. Enjoying Relevance, the IT semantics is suitable top-down querying when complete models are unnecessary. The applications afforded by ITS are all those of Stable Models, which it generalizes, plus those employing OLONs for productively obtaining problem solutions, not just filtering them (like ICs).
Original languageEnglish
Title of host publicationLiber Amicorum in honour of Maurice Bruynooghe
Place of PublicationLeuven
Number of pages14
Publication statusPublished - 2010
EventSymposium on the Occasion of Maurice Bruynooghe's 60th Birthday - Department of Computer Science of the Katholieke Universiteit Leuven, Leuven, Belgium
Duration: 7 Jul 2010 → …


ConferenceSymposium on the Occasion of Maurice Bruynooghe's 60th Birthday
Period7/07/10 → …


Dive into the research topics of 'Inductive Tight Semantics for Logic Programs'. Together they form a unique fingerprint.

Cite this