IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Lparse Programs Revisited: Semantics and Representation of Aggregates
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Design and implementation of aggregate functions in the dlv system*
Theory and Practice of Logic Programming
Integrating answer set programming and constraint logic programming
Annals of Mathematics and Artificial Intelligence
Answer sets for logic programs with arbitrary abstract constraint atoms
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Answer Set Programming with Constraints Using Lazy Grounding
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A Module-Based Framework for Multi-language Constraint Modeling
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A generalized gelfond-lifschitz transformation for logic programs with abstract constraints
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Answer sets for logic programs with arbitrary abstract constraint atoms
Journal of Artificial Intelligence Research
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
Theory and Practice of Logic Programming
A 25-year perspective on logic programming
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
ASP at work: spin-off and applications of the DLV system
Logic programming, knowledge representation, and nonmonotonic reasoning
A semantic account for modularity in multi-language modelling of search problems
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
| Hi-index | 0.00 |
In [2], we presented a system called - for computing answer sets of logic programs with aggregates. The implementation of - relies on the use of an external constraint solver (ECLiPSe) to deal with aggregate literals and requires some modifications to the answer set solver used in the experiment (Smodels). In general, the system is capable of computing answer sets of arbitrary programs with aggregates, i.e., there is no syntactical restrictions imposed on the inputs to the system. This makes - different from dlvA (built BEN/5/23/04) [1], which deals with stratified programs only. -, however, is based on a semantics that does not guarantee minimality of answer sets. Furthermore, our experiments with - indicate that the cost of communication between the constraint solver and the answer set solver proves to be significant in large instances.