ASPeRiX, a first-order forward chaining approach for answer set computing

DOI10.1017/S1471068416000569zbMath1379.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)

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

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

Related Items (12)

Unnamed Item ⋮ Partial Compilation of ASP Programs ⋮ Incremental Answer Set Programming with Overgrounding ⋮ Unnamed Item ⋮ 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 ⋮ Optimizing Answer Set Computation via Heuristic-Based Decomposition ⋮ The Seventh Answer Set Programming Competition: Design and Results ⋮ Efficiently Coupling the I-DLV Grounder with ASP Solvers ⋮ Abstraction for non-ground answer set programs ⋮ $$\exists $$ -ASP for Computing Repairs with Existential Ontologies

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logic programming and nonmonotonic reasoning. 12th international conference, LPNMR 2013, Corunna, Spain, September 15--19, 2013. Proceedings
• 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
• ASSAT: computing answer sets of a logic program by SAT solvers
• Answer set programming based on propositional satisfiability
• Logic programs with abstract constraint atoms: the role of computations
• Extending and implementing the stable model semantics
• Conflict-driven answer set solving: from theory to practice
• Logic programs with stable model semantics as a constraint programming paradigm
• Logic programming and nonmonotonic reasoning. 8th international conference, LPNMR 2005, Diamante, Italy, September 5--8, 2005. Proceedings.
• Enhancing DLV instantiator by backjumping techniques
• The Intelligent Grounder of DLV
• Connecting First-Order ASP and the Logic FO(ID) through Reducts
• GASP: Answer Set Programming with Lazy Grounding
• Graphs and colorings for answer set programming
• Experimenting with parallelism for the instantiation of ASP programs
• A decidable subclass of finitary programs
• Disjunctive ASP with functions: Decidable queries and effective computation
• Knowledge Representation, Reasoning and Declarative Problem Solving
• ASP modulo CSP: The clingcon system
• The DLV system for knowledge representation and reasoning
• One More Decidable Class of Finitely Ground Programs
• Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments
• Logic Programming
• Engineering an Incremental ASP Solver
• Computable Functions in ASP: Theory and Implementation

This page was built for publication: ASPeRiX, a first-order forward chaining approach for answer set computing