Remmel, Jeffrey B. ;
Marek, Victor W.
Set Based Logic Programming
Abstract
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 GelfondLifschitz construction generalizes to at least two different notions of stable models.
BibTeX  Entry
@InProceedings{remmel_et_al:DSP:2005:266,
author = {Jeffrey B. Remmel and Victor W. Marek},
title = {Set Based Logic Programming},
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 = {18624405},
publisher = {Internationales Begegnungs und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2005/266},
annote = {Keywords: ASP, codes for infinite sets, stable model generalizations}
}
2005
Keywords: 

ASP, codes for infinite sets, stable model generalizations 
Seminar: 

05171  Nonmonotonic Reasoning, Answer Set Programming and Constraints

Related Scholarly Article: 


Issue date: 

2005 
Date of publication: 

2005 