Partial Compilation of ASP Programs

DOI10.1017/S1471068419000231zbMath1434.68072arXiv1907.10469OpenAlexW2963672115WikidataQ127174332 ScholiaQ127174332MaRDI QIDQ5108506

Francesco Ricca, Carmine Dodaro, Bernardo Cuteri, Peter Schüller

Publication date: 4 May 2020

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.10469

zbMATH Keywords

compilationanswer set programminggrounding bottleneck

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Logic programming (68N17)

Related Items (2)

Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More ⋮ DualGrounder: lazy instantiation via clingo multi-shot framework

Uses Software

• Gringo
• clasp
• GASP
• WASP
• Clingcon
• Clingo
• ASPMT2SMT
• Datalog
• ezcsp
• DLV2

Cites Work

• Unnamed Item
• Unnamed Item
• Extending and implementing the stable model semantics
• A logic-based question answering system for cultural heritage
• Blending lazy-grounding and CDNL search for answer-set solving
• The Intelligent Grounder of DLV
• System aspmt2smt: Computing ASPMT Theories by SMT Solvers
• Optimization Methods for the Partner Units Problem
• Efficiently Querying RDF(S) Ontologies with Answer Set Programming
• GASP: Answer Set Programming with Lazy Grounding
• Advances in WASP
• Progress in clasp Series 3
• Combining Heuristics for Configuration Problems Using Answer Set Programming
• Answer Set Programming: A Primer
• Modularity Aspects of Disjunctive Stable Models
• Generating explanations for biomedical queries
• Optimizing phylogenetic supertrees using answer set programming
• Taming primary key violations to query large inconsistent data via ASP
• A model building framework for answer set programming with external computations
• Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
• ASPeRiX, a first-order forward chaining approach for answer set computing
• Constraint answer set solver EZCSP and why integration schemas matter
• ASP modulo CSP: The clingcon system
• Efficiently Coupling the I-DLV Grounder with ASP Solvers
• The External Interface for Extending WASP
• The DLV system for knowledge representation and reasoning

This page was built for publication: Partial Compilation of ASP Programs