Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Extending and implementing the stable model semantics
Artificial Intelligence
Pushing Goal Derivation in DLP Computations
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Backjumping for quantified Boolean logic satisfiability
Artificial Intelligence
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)
A backjumping technique for disjunctive logic programming
AI Communications
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
A Constructive semantic characterization of aggregates in answer set programming
Theory and Practice of Logic Programming
Well-founded and stable semantics of logic programs with aggregates
Theory and Practice of Logic Programming
On look-ahead heuristics in disjunctive logic programming
Annals of Mathematics and Artificial Intelligence
Design and implementation of aggregate functions in the dlv system*
Theory and Practice of Logic Programming
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
On Reductive Semantics of Aggregates in Answer Set Programming
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The Second Answer Set Programming Competition
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A general backtrack algorithm that eliminates most redundant tests
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The first answer set programming system competition
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Clasp: a conflict-driven answer set solver
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
GrinGo: a new grounder for answer set programming
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Semantics and complexity of recursive aggregates in answer set programming
Artificial Intelligence
A Logic-Based System for e-Tourism
Fundamenta Informaticae - On the Italian Conference on Computational Logic: CILC 2009
Solving hard ASP programs efficiently
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
The HiLeX system for semantic information extraction
Transactions on Large-Scale Data- and Knowledge-Centered Systems V
Team-building with answer set programming in the gioia-tauro seaport
Theory and Practice of Logic Programming
Hi-index | 0.00 |
The introduction of aggregates has been one of the most relevant language extensions to Answer Set Programming (ASP). Aggregates are very expressive, they allow to represent many problems in a more succinct and elegant way compared to aggregate-free programs. A significant amount of research work has been devoted to aggregates in the ASP community in the last years, and relevant research results on ASP with aggregates have been published, on both theoretical and practical sides. The high expressiveness of aggregates (eliminating aggregates often causes a quadratic blow-up in program size) requires suitable evaluation methods and optimization techniques for an efficient implementation. Nevertheless, in spite of the above-mentioned research developments, aggregates are treated in a quite straightforward way in most ASP systems. In this paper, we explore the exploitation of look-back techniques for an efficient implementation of aggregates. We define a reason calculus for backjumping in ASP programs with aggregates. Furthermore, we describe how these reasons can be used in order to guide look-back heuristics for programs with aggregates. We have implemented both the new reason calculus and the proposed heuristics in the DLV system, and have carried out an experimental analysis on publicly available benchmarks which shows significant performance benefits.