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. |
Year | DOI | Venue |
---|---|---|
2011 | 10.3233/FI-2013-843 | Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011 |
Keywords | DocType | Volume |
practical answer set programming,nested weight constraints,nested weight constraint,answer set programming paradigm,powerful programming,weight constraint,knowledge representation | Conference | 124 |
Issue | ISSN | Citations |
4 | 0169-2968 | 0 |
PageRank | References | Authors |
0.34 | 23 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Stefania Costantini | 1 | 536 | 59.90 |
Andrea Formisano | 2 | 301 | 32.94 |