Article contents
The External Interface for Extending WASP
Published online by Cambridge University Press: 10 December 2018
Abstract
Answer set programming (ASP) is a successful declarative formalism for knowledge representation and reasoning. The evaluation of ASP programs is nowadays based on the conflict-driven clause learning (CDCL) backtracking search algorithm. Recent work suggested that the performance of CDCL-based implementations can be considerably improved on specific benchmarks by extending their solving capabilities with custom heuristics and propagators. However, embedding such algorithms into existing systems requires expert knowledge of the internals of ASP implementations. The development of effective solver extensions can be made easier by providing suitable programming interfaces. In this paper, we present the interface for extending the CDCL-based ASP solver wasp. The interface is both general, that is, it can be used for providing either new branching heuristics or propagators, and external, that is, the implementation of new algorithms requires no internal modifications of wasp. Moreover, we review the applications of the interface witnessing it can be successfully used to extend wasp for solving effectively hard instances of both real-world and synthetic problems.
Keywords
- Type
- Technical Note
- Information
- Copyright
- © Cambridge University Press 2018
Footnotes
The paper has been partially supported by the Italian Ministry for Economic Development (MISE) under project “PIUCultura – Paradigmi Innovativi per l’Utilizzo della Cultura” (no. F/020016/01-02/X27), and under project “Smarter Solutions in the Big Data World (S2BDW)” (no. F/050389/01-03/X32) funded within the call “HORIZON2020” PON I&C 2014-2020. Authors are grateful to Mario Alviano, Bernardo Cuteri, Philip Gasteiger, Nicola Leone, Benjamin Musitsch, Peter Schüller, and Kostyantyn Shchekotykhin for their suggestions.
References
- 9
- Cited by