zbMATH — the first resource for mathematics

The Hexlite solver. Lightweight and efficient evaluation of HEX programs. (English) Zbl 07169133
Calimeri, Francesco (ed.) et al., Logics in artificial intelligence. 16th European conference, JELIA 2019, Rende, Italy, May 7–11, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-19569-4/pbk; 978-3-030-19570-0/ebook). Lecture Notes in Computer Science 11468. Lecture Notes in Artificial Intelligence, 593-607 (2019).
Summary: Hexlite is a lightweight solver for the HEX formalism which integrates answer set programming (ASP) with external computations. The main goal of Hexlite is efficiency and simplicity, both in implementation as well as in installation of the system. We define the pragmatic HEX fragment which permits to partition external computations into two kinds: those that can be evaluated during the program instantiation phase, and those that need to be evaluated during the answer set search phase. Hexlite is written in Python and suitable for evaluating this fragment with external computations that are realized in Python. Most performance-critical tasks are delegated to the Python module of Clingo. We demonstrate that the pragmatic HEX fragment is sufficient for many use cases and that it permits Hexlite to have superior performance compared to the DLVHEX system in relevant application scenarios.
For the entire collection see [Zbl 1412.68007].
68T27 Logic in artificial intelligence
Full Text: DOI