Nested Weight Constraints in ASP

Authors:
Stefania Costantini;Andrea Formisano
Affiliations:
DISIM-Universita degli Studi di L'Aquila, Via Vetoio Loc. Coppito, I-67100 L'Aquila, Italy. Stefania.Costantini@univaq.it;Dipartimento di Matematica e Informatica, Universita di Perugia, via Vanvitelli 1, I-06123, Perugia, Italy. formis@dmi.unipg.it
Venue:
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Year:
2013

Citing 21
Cited 0

Answer set planning

Proceedings of the 1999 international conference on Logic programming
Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Extending and implementing the stable model semantics

Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Stable Model Semantics of Weight Constraint Rules

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Strong equivalence made easy: nested expressions and weight constraints

Theory and Practice of Logic Programming
Weight constraints as nested expressions

Theory and Practice of Logic Programming
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
Well-founded and stable semantics of logic programs with aggregates

Theory and Practice of Logic Programming
Modeling preferences and conditional preferences on resource consumption and production in ASP

Journal of Algorithms
An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems

Journal of Experimental & Theoretical Artificial Intelligence
Logic programming and nonmonotonic reasoning: from theory to systems and applications

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Logic programming for knowledge representation

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Answer Set Programming with Resources

Journal of Logic and Computation
Semantics and complexity of recursive aggregates in answer set programming

Artificial Intelligence
Weight constraints with preferences in ASP

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Extending and Implementing RASP

Fundamenta Informaticae - On the Italian Conference on Computational Logic: CILC 2009
A comparison of CLP(FD) and ASP solutions to NP-Complete problems

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Unfounded sets and well-founded semantics of answer set programs with aggregates

Journal of Artificial Intelligence Research
Strong equivalence of RASP programs

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

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.