GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Extending the Smodels system with cardinality and weight constraints
Logic-based artificial intelligence
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
Extending and implementing the stable model semantics
Artificial Intelligence
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Building knowledge systems in a-prolog
Building knowledge systems in a-prolog
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 based design of knowledge systems
Annals of Mathematics and Artificial Intelligence
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Probabilistic reasoning with answer sets
Theory and Practice of Logic Programming
On the relation among answer set solvers
Annals of Mathematics and Artificial Intelligence
The Conflict-Driven Answer Set Solver clasp: Progress Report
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
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The effect of restarts on the efficiency of clause learning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Negotiation using logic programming with consistency restoring rules
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Clasp: a conflict-driven answer set solver
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Tableau calculi for answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Special issue on answer set programming
AI Communications - Answer Set Programming
The multi-engine ASP solver ME-ASP
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Evaluating tree-decomposition based algorithms for answer set programming
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
| Hi-index | 0.00 |
In spite of the improvements in the performance of many solvers for model-based languages, it is still possible for the search algorithm to focus on the wrong areas of the search space, preventing the solver from returning a solution in an acceptable amount of time. This prospect is a real concern e.g. in an industrial setting, where users typically expect consistent performance. To overcome this problem, we propose a framework that allows learning and using domain-specific heuristics in the solvers. The learning is done offline, on representative instances from the target domain, and the learned heuristics are then used for choice-point selection. In this paper we focus on Answer Set Programming (ASP) solvers. In our experiments, the introduction of domain-specific heuristics improved performance quite substantially on hard instances, and in particular made overall performance more consistent by reducing the number of cases in which the solver timed out.