Partial Compilation of ASP Programs

• Published in: arXiv.org
• Main Authors: Cuteri, Bernardo, Dodaro, Carmine, Ricca, Francesco, Schüller, Peter
• Format: Paper Journal Article
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 24.07.2019
• Subjects: Algorithms; Combinatorial analysis; Computer Science - Artificial Intelligence; Computer Science - Logic in Computer Science; Declarative programming; Logic programming; Mathematical programming
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.1907.10469

Answer Set Programming (ASP) is a well-known declarative formalism in logic programming. Efficient implementations made it possible to apply ASP in many scenarios, ranging from deductive databases applications to the solution of hard combinatorial problems. State-of-the-art ASP systems are based on the traditional ground\&solve approach and are general-purpose implementations, i.e., they are essentially built once for any kind of input program. In this paper, we propose an extended architecture for ASP systems, in which parts of the input program are compiled into an ad-hoc evaluation algorithm (i.e., we obtain a specific binary for a given program), and might not be subject to the grounding step. To this end, we identify a condition that allows the compilation of a sub-program, and present the related partial compilation technique. Importantly, we have implemented the new approach on top of a well-known ASP solver and conducted an experimental analysis on publicly-available benchmarks. Results show that our compilation-based approach improves on the state of the art in various scenarios, including cases in which the input program is stratified or the grounding blow-up makes the evaluation unpractical with traditional ASP systems.