Constraint answer set programming without grounding
From MaRDI portal
Publication:4559798
DOI10.1017/S1471068418000285zbMATH Open1451.68063arXiv1804.11162MaRDI QIDQ4559798FDOQ4559798
Authors: Joaquin Arias, M. Carro, Elmer Salazar, Kyle Marple, Gopal Gupta 
Publication date: 4 December 2018
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Abstract: Extending ASP with constraints (CASP) enhances its expressiveness and performance. This extension is not straightforward as the grounding phase, present in most ASP systems, removes variables and the links among them, and also causes a combinatorial explosion in the size of the program. Several methods to overcome this issue have been devised: restricting the constraint domains (e.g., discrete instead of dense), or the type (or number) of models that can be returned. In this paper we propose to incorporate constraints into s(ASP), a goal-directed, top-down execution model which implements ASP while retaining logical variables both during execution and in the answer sets. The resulting model, s(CASP), can constrain variables that, as in CLP, are kept during the execution and in the answer sets. s(CASP) inherits and generalizes the execution model of s(ASP) and is parametric w.r.t. the constraint solver. We describe this novel execution model and show through several examples the enhanced expressiveness of s(CASP) w.r.t. ASP, CLP, and other CASP systems. We also report improved performance w.r.t. other very mature, highly optimized ASP systems in some benchmarks. This paper is under consideration for publication in Theory and Practice of Logic Programming (TPLP).
Full work available at URL: https://arxiv.org/abs/1804.11162
Recommendations
Cites Work
- External sources of knowledge and value invention in logic programming
- GASP: Answer set programming with lazy grounding
- Clingo goes linear constraints over reals and integers
- \textit{clingcon}: the next generation
- Constraint answer set solver EZCSP and why integration schemas matter
- Title not available (Why is that?)
- Magic sets for disjunctive Datalog programs
- Abduction in well-founded semantics and generalized stable models via tabled dual programs
- An overview of Ciao and its design philosophy
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints
- Logic Programming
- A decidable subclass of finitary programs
- On finitely recursive programs
Cited In (23)
- GK: implementing full first order default logic for commonsense reasoning (system description)
- Title not available (Why is that?)
- The power of non-ground rules in Answer Set Programming
- Abstraction for non-ground answer set programs
- Answer Set Programming without Unstratified Negation
- Title not available (Why is that?)
- Synthesizing Imperative Code from Answer Set Programming Specifications
- Enhancing ASP Systems for Planning with Temporal Constraints
- CASP solutions for planning in hybrid domains
- An ASP-based Approach to Answering Natural Language Questions for Texts
- A logic-based framework leveraging neural networks for studying the evolution of neurological disorders
- Proof-theoretic foundations of normal logic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Model-based diagnosis with ASP for non-groundable domains
- Fifty Years of Prolog and Beyond
- Building Information Modeling Using Constraint Logic Programming
- FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data
- MILP, pseudo-Boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks
- Modeling and reasoning in event calculus using goal-directed constraint answer set programming
- Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming
- FOLD-R++: a scalable toolset for automated inductive learning of default theories from mixed data
Uses Software
This page was built for publication: Constraint answer set programming without grounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559798)
