2026-07-21T10:22:54Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:259 2024-03-06T11:06:20Z ddc:004 open_access

Normal Form Theorem for Logic Programs with Cardinality Constraints Marek, Victor W. Remmel, Jeffrey B. Proof scheme cardinality constraints 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Victor W. Marek and Jeffrey B. Remmel 2005 Is Part Of Dagstuhl Seminar Proceedings, Volume 5171, Nonmonotonic Reasoning, Answer Set Programming and Constraints (2005) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.05171.5 urn:nbn:de:0030-drops-2598 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05171.5 eng https://creativecommons.org/licenses/by/4.0/legalcode