@MISC{Marek_extensionsof, author = {V. W. Marek and J. B. Remmel}, title = {Extensions of Answer Set Programming}, year = {} }

Share

OpenURL

Abstract

We discuss a number of possible extensions of Answer Set Programming. The four formalisms we investigate are: 1. logic programs where the negative parts of the bodies in clauses can be replaced by arbitrary constraints which we call Arbitrary Constraint Logic Programming (ACLP), 2. logic programs where we are allowed arbitrary set constraint atoms, 3. logic programs where atoms represent sets from some fixed set X and the one-step provability operator is composed with a monotone idempotent operator on2 X which we call Set-based Logic Programming (SBLP), and 4. logic programming where the clauses (rules) have embedded algorithms which we call Hybrid Answer Set Programming (H-ASP).