Tight Semantics for Logic Programs

DI Group Author

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)


We define the Tight Semantics TS, for all NLPs complying with the requirements: 2-valued; preserve SM models; guarantee of model existence in face of Odd Loops Over Negation (OLONs) or infinite chains; relevance; cumulativity; compliance with WFM. When complete models are unnecessary and top-down querying is desired, TS provides a 2-valued option guaranteeing model existence, abduction by need rendered available too. The user does not pay for computing whole models nor for generating all possible abductions, only to filter irrelevant ones later. A TS model of a NLP P is any minimal model M of P that further satisfies P^-the remainder of P-in that each loop in P^ has a MM contained in M whilst respecting the constraints imposed by the MMs of the other loops so-constrained too. Applications of TS are all those of Stable Models plus those permitting to solve OLONs for model existence, and those employing OLONs for productively obtaining solutions, not just filtering them (like ICs).
Original languageUnknown
Title of host publicationLeibniz International Proceedings in Informatics (LIPIcs)
EditorsM Hermenegildo, T Schaub
Place of Publicationhttp://drops.dagstuhl.de/portals/extern/index.php?semnr=10003
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany
ISBN (Print)978-3-939897-17-0
Publication statusPublished - 1 Jan 2010
EventInternational Conference on Logic Programming (ICLP) -
Duration: 1 Jan 2010 → …


ConferenceInternational Conference on Logic Programming (ICLP)
Period1/01/10 → …

Cite this

DI Group Author (2010). Tight Semantics for Logic Programs. In M. Hermenegildo, & T. Schaub (Eds.), Leibniz International Proceedings in Informatics (LIPIcs) (Vol. 7, pp. 134-143). http://drops.dagstuhl.de/portals/extern/index.php?semnr=10003: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. https://doi.org/10.4230/LIPIcs.ICLP.2010.134