ASPeRiX, a first-order forward chaining approach for answer set computing
From MaRDI portal
Publication:4593088
DOI10.1017/S1471068416000569zbMATH Open1379.68075arXiv1503.07717OpenAlexW2964210039MaRDI QIDQ4593088
Claire Lefèvre, Igor Stéphan, Laurent Garcia, Christopher Béatrix
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Abstract: The natural way to use Answer Set Programming (ASP) to represent knowledge in Artificial Intelligence or to solve a combinatorial problem is to elaborate a first order logic program with default negation. In a preliminary step this program with variables is translated in an equivalent propositional one by a first tool: the grounder. Then, the propositional program is given to a second tool: the solver. This last one computes (if they exist) one or many answer sets (stable models) of the program, each answer set encoding one solution of the initial problem. Until today, almost all ASP systems apply this two steps computation. In this article, the project ASPeRiX is presented as a first order forward chaining approach for Answer Set Computing. This project was amongst the first to introduce an approach of answer set computing that escapes the preliminary phase of rule instantiation by integrating it in the search process. The methodology applies a forward chaining of first order rules that are grounded on the fly by means of previously produced atoms. Theoretical foundations of the approach are presented, the main algorithms of the ASP solver ASPeRiX are detailed and some experiments and comparisons with existing systems are provided.
Full work available at URL: https://arxiv.org/abs/1503.07717
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30) Logic programming (68N17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- GASP: Answer Set Programming with Lazy Grounding
- ASSAT: computing answer sets of a logic program by SAT solvers
- Extending and implementing the stable model semantics
- Logic programming and nonmonotonic reasoning. 8th international conference, LPNMR 2005, Diamante, Italy, September 5--8, 2005. Proceedings.
- Knowledge Representation, Reasoning and Declarative Problem Solving
- The DLV system for knowledge representation and reasoning
- One More Decidable Class of Finitely Ground Programs
- Computable Functions in ASP: Theory and Implementation
- Conflict-driven answer set solving: from theory to practice
- Logic programs with stable model semantics as a constraint programming paradigm
- Engineering an Incremental ASP Solver
- Answer set programming based on propositional satisfiability
- Logic programming and nonmonotonic reasoning. 12th international conference, LPNMR 2013, Corunna, Spain, September 15--19, 2013. Proceedings
- ASP modulo CSP: The clingcon system
- Logic Programming
- Logic programming and nonmonotonic reasoning. 11th international conference, LPNMR 2011, Vancouver, Canada, May 16--19, 2011. Proceedings
- A non-ground realization of the stable and well-founded semantics
- Logic programming and nonmonotonic reasoning. 10th international conference, LPNMR 2009, Potsdam, Germany, September 14--18, 2009. Proceedings
- The Intelligent Grounder of DLV
- Logic programs with abstract constraint atoms: the role of computations
- Connecting First-Order ASP and the Logic FO(ID) through Reducts
- Enhancing DLV instantiator by backjumping techniques
- Graphs and colorings for answer set programming
- Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments
- Finitely recursive programs: decidability and bottom-up computation
- Experimenting with parallelism for the instantiation of ASP programs
- A decidable subclass of finitary programs
- Disjunctive ASP with functions: Decidable queries and effective computation
Cited In (12)
- Title not available (Why is that?)
- Incremental Answer Set Programming with Overgrounding
- Efficiently Coupling the I-DLV Grounder with ASP Solvers
- Optimizing Answer Set Computation via Heuristic-Based Decomposition
- Partial Compilation of ASP Programs
- Abstraction for non-ground answer set programs
- Answering the “why” in answer set programming – A survey of explanation approaches
- $$\exists $$ -ASP for Computing Repairs with Existential Ontologies
- The Seventh Answer Set Programming Competition: Design and Results
- Incremental maintenance of overgrounded logic programs with tailored simplifications
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
- Title not available (Why is that?)
Uses Software
This page was built for publication: ASPeRiX, a first-order forward chaining approach for answer set computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593088)
