Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 2013608 (Why is no real title available?)
- A logic-based question answering system for cultural heritage
- A model building framework for answer set programming with external computations
- ASP modulo CSP: the clingcon system
- Advances in WASP
- Answer Set Programming: A Primer
- Blending lazy-grounding and CDNL search for answer-set solving
- Combining Heuristics for Configuration Problems Using Answer Set Programming
- Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
- Constraint answer set solver EZCSP and why integration schemas matter
- Efficiently Querying RDF(S) Ontologies with Answer Set Programming
- Extending and implementing the stable model semantics
- GASP: Answer set programming with lazy grounding
- Generating explanations for biomedical queries
- Modularity aspects of disjunctive stable models
- Optimization Methods for the Partner Units Problem
- Optimizing phylogenetic supertrees using answer set programming
- Progress in clasp series 3
- System \textsc{aspmt2smt}: computing ASPMT theories by SMT solvers
- Taming primary key violations to query large inconsistent data via ASP
- Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
- The DLV system for knowledge representation and reasoning
- The External Interface for Extending WASP
- The intelligent grounder of DLV
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
Cited in
(8)- Look-back techniques for ASP programs with aggregates
- IASCAR: incremental answer set counting by anytime refinement
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
- scientific article; zbMATH DE number 7455702 (Why is no real title available?)
- Optimizing answer set computation via heuristic-based decomposition
- DualGrounder: lazy instantiation via clingo multi-shot framework
- Lazy atom discovery in compilation-based ASP solving
- Complexity of super-coherence problems in ASP
Describes a project that uses
Uses Software
This page was built for publication: Partial compilation of ASP programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5108506)
