Set Based Logic Programming
Published in DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) • Jan 1, 2005
NobleIDNI5P41W27R68S52
Authors:,
Jeffrey B. Remmel
Victor W. Marek
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 constrai...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!