License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-2598
URL: https://drops.dagstuhl.de/opus/volltexte/2005/259/
Go to the corresponding Portal


Marek, Victor W. ; Remmel, Jeffrey B.

Normal Form Theorem for Logic Programs with Cardinality Constraints

pdf-format:
05171.MarekVictor.Paper.259.pdf (0.4 MB)


Abstract

We discuss proof schemes, a kind of context-dependent proofs for logic
programs. We show usefullness of these constructs both in the context of
normal logic programs and their generalizations due to Niemela and
collaborators. As an application we show the following result. For every
cardinality-constraint logic program P there is a logic program P´ with the
same heads, but with bodies consisting of atoms and negated atoms such
that P and P´ have same stable models. It is worth noting that another
proof of same result can be obtained from the results by Lifschitz and
collaborators.

BibTeX - Entry

@InProceedings{marek_et_al:DSP:2005:259,
  author =	{Victor W. Marek and Jeffrey B. Remmel},
  title =	{Normal Form Theorem for Logic Programs with Cardinality Constraints},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  year =	{2005},
  editor =	{Gerhard Brewka and Ilkka Niemel{\"a} and Torsten Schaub and Miroslaw Truszczynski},
  number =	{05171},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2005/259},
  annote =	{Keywords: Proof scheme, cardinality constraints}
}

Keywords: Proof scheme, cardinality constraints
Collection: 05171 - Nonmonotonic Reasoning, Answer Set Programming and Constraints
Issue Date: 2005
Date of publication: 14.09.2005


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI