Nested Weight Constraints in ASP

Issue title: Special Issue on the Italian Conference on Computational Logic: CILC 2011

Article type: Research Article

Authors: Costantini, Stefania | Formisano, Andrea

Affiliations: DISIM - Universita degli Studi di L'Aquila, Via Vetoio Loc. Coppito, I-67100 L'Aquila, Italy. [email protected] | Dipartimento di Matematica e Informatica, Universita di Perugia, via Vanvitelli 1, I-06123, Perugia, Italy. [email protected]

Note: [] Address for correspondence: DISIM - Universita degli Studi di L'Aquila, Via Vetoio Loc. Coppito, I-67100 L'Aquila, Italy

Abstract: Weight constraints are a powerful programming construct that has proved very useful within the Answer Set Programming paradigm. In this paper, we argue that practical Answer Set Programming might take profit from introducing some forms of nested weight constraints. We define such empowered constraints (that we call “Nested Weight Constraints”) and discuss their semantics and their complexity.

Keywords: Weight constraints in ASP, Non-monotonic reasoning, Knowledge representation

DOI: 10.3233/FI-2013-843

Journal: Fundamenta Informaticae, vol. 124, no. 4, pp. 449-464, 2013