{\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing

DOI10.1017/S1471068416000569MaRDI QIDQ4593088zbMATH OpenOpenAlexFDO

Authors Claire Lefèvre, Christopher Béatrix, Igor Stéphan, Laurent Garcia

Publication date 9 November 2017

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

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

zbMATH Keywords

answer set programmingfirst-order forward chaininggrounding on the flysolver implementation

Mathematics Subject Classification ID

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30)

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.

Recommendations

• A First Order Forward Chaining Approach for Answer Set Computing
• Integrating grounding in the search process for answer set computing
• Answer Set Programming: A Primer
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Forward chaining for hybrid ASP

Cites work

• A decidable subclass of finitary programs
• A non-ground realization of the stable and well-founded semantics
• Answer set programming based on propositional satisfiability
• ASP modulo CSP: the clingcon system
• ASSAT: computing answer sets of a logic program by SAT solvers
• Computable Functions in ASP: Theory and Implementation
• Conflict-driven answer set solving: from theory to practice
• Connecting first-order ASP and the logic FO(ID) through reducts
• Disjunctive ASP with functions: decidable queries and effective computation
• Engineering an Incremental ASP Solver
• Enhancing DLV instantiator by backjumping techniques
• Experimenting with parallelism for the instantiation of ASP programs
• Extending and implementing the stable model semantics
• Finitely recursive programs: decidability and bottom-up computation
• GASP: Answer set programming with lazy grounding
• Graphs and colorings for answer set programming
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 6139984 (Why is no real title available?)
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming
• Logic programming and nonmonotonic reasoning. 10th international conference, LPNMR 2009, Potsdam, Germany, September 14--18, 2009. Proceedings
• Logic programming and nonmonotonic reasoning. 11th international conference, LPNMR 2011, Vancouver, Canada, May 16--19, 2011. Proceedings
• Logic programming and nonmonotonic reasoning. 12th international conference, LPNMR 2013, Corunna, Spain, September 15--19, 2013. Proceedings
• Logic programming and nonmonotonic reasoning. 8th international conference, LPNMR 2005, Diamante, Italy, September 5--8, 2005. Proceedings.
• Logic programming with function symbols: checking termination of bottom-up evaluation through program adornments
• Logic programs with abstract constraint atoms: the role of computations
• Logic programs with stable model semantics as a constraint programming paradigm
• One More Decidable Class of Finitely Ground Programs
• Representing constraint satisfaction problems in answer set programming
• The DLV system for knowledge representation and reasoning
• The intelligent grounder of DLV

Cited in

(18)

• Integrating grounding in the search process for answer set computing
• Forward chaining for hybrid ASP
• A First Order Forward Chaining Approach for Answer Set Computing
• Optimizing answer set computation via heuristic-based decomposition
• The Seventh Answer Set Programming Competition: Design and Results
• Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
• scientific article; zbMATH DE number 7453100 (Why is no real title available?)
• Partial compilation of ASP programs
• Incremental answer set programming with overgrounding
• Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
• Incremental maintenance of overgrounded logic programs with tailored simplifications
• Answering the ``why in answer set programming -- a survey of explanation approaches
• scientific article; zbMATH DE number 7121940
• -ASP for computing repairs with existential ontologies
• Abstraction for non-ground answer set programs
• DIRT: a literature-based benchmark suite for grounders
• Quantified constraint handling rules
• On the foundations of grounding in answer set programming

Describes a project that uses

Uses Software

• ASSAT
• WASP
• OMiGA
• Gringo
• GASP
• Clingcon

This page was built for publication: {\textsc{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)