1 Search Results for "Pereira, Luis Moniz"


Document
Tight Semantics for Logic Programs

Authors: Luis Moniz Pereira and Alexandre Miguel Pinto

Published in: LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010)


Abstract
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence, even in face of Odd Loops Over Negation (OLONs) or infinite chains; relevance cumulativity; and compliance with the Well-Founded Model. When complete models are unnecessary, and top-down querying (à la Prolog) is desired, TS provides the 2-valued option that guarantees model existence, as a result of its relevance property. Top-down querying with abduction by need is rendered available too by TS. The user need not pay the price of computing whole models, nor that of generating all possible abductions, only to filter irrelevant ones subsequently. A TS model of a NLP P is any minimal model M of P that further satisfies P^---the program 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. The applications afforded by TS are all those of Stable Models, which it generalizes, plus those permitting to solve OLONs for model existence, plus those employing OLONs for productively obtaining problem solutions, not just filtering them (like Integrity Constraints).

Cite as

Luis Moniz Pereira and Alexandre Miguel Pinto. Tight Semantics for Logic Programs. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 134-143, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


Copy BibTex To Clipboard

@InProceedings{pereira_et_al:LIPIcs.ICLP.2010.134,
  author =	{Pereira, Luis Moniz and Pinto, Alexandre Miguel},
  title =	{{Tight Semantics for Logic Programs}},
  booktitle =	{Technical Communications of the 26th International Conference on Logic Programming},
  pages =	{134--143},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-17-0},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{7},
  editor =	{Hermenegildo, Manuel and Schaub, Torsten},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.134},
  URN =		{urn:nbn:de:0030-drops-25919},
  doi =		{10.4230/LIPIcs.ICLP.2010.134},
  annote =	{Keywords: Normal Logic Programs, Relevance, Cumulativity, Stable Models, Well-Founded Semantics, Program Remainder}
}
  • Refine by Author
  • 1 Pereira, Luis Moniz
  • 1 Pinto, Alexandre Miguel

  • Refine by Classification

  • Refine by Keyword
  • 1 Cumulativity
  • 1 Normal Logic Programs
  • 1 Program Remainder
  • 1 Relevance
  • 1 Stable Models
  • Show More...

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2010

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail