Partial Compilation of ASP Programs

07/24/2019
by   Bernardo Cuteri, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/17/2021

Compilation of Aggregates in ASP

Answer Set Programming (ASP) is a well-known problem-solving formalism i...
research
05/21/2017

Sketched Answer Set Programming

Answer Set Programming (ASP) is a powerful modeling formalism for combin...
research
09/22/2020

A Machine Learning guided Rewriting Approach for ASP Logic Programs

Answer Set Programming (ASP) is a declarative logic formalism that allow...
research
04/30/2018

Constraint Answer Set Programming without Grounding

Extending ASP with constraints (CASP) enhances its expressiveness and pe...
research
04/30/2018

Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning

Meta-Interpretive Learning (MIL) learns logic programs from examples by ...
research
08/07/2020

Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints

Generalising and re-using knowledge learned while solving one problem in...
research
09/17/2021

DiscASP: A Graph-based ASP System for Finding Relevant Consistent Concepts with Applications to Conversational Socialbots

We consider the problem of finding relevant consistent concepts in a con...

Please sign up or login with your details

Forgot password? Click here to reset