2026-08-11T13:18:14Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:266 2024-03-06T11:06:21Z ddc:004 open_access

Set Based Logic Programming Remmel, Jeffrey B. Marek, Victor W. ASP codes for infinite sets stable model generalizations We propose a set of desiderata for extensions of Answer Set Programming to capture domains where the objects of interest are infinite sets and yet we can still process ASP programs effectively. We propose two different schemes to do this. One is to extend cardinality type constraints to set constraints which involve codes for finite, recursive and recursively enumerable sets. A second scheme to modify logic programming to reason about sets directly. In this setting, we can also augment logic programming with certain monotone inductive operators so that we can reason about families of sets which have structure such a closed sets of a topological space or subspaces of a vector space. We observe that under such conditions, the classic Gelfond-Lifschitz construction generalizes to at least two different notions of stable models. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jeffrey B. Remmel and Victor W. Marek 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.8 urn:nbn:de:0030-drops-2667 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05171.8 eng https://creativecommons.org/licenses/by/4.0/legalcode