Arrêt de service programmé du vendredi 10 juin 16h jusqu’au lundi 13 juin 9h. Pour en savoir plus
Accéder directement au contenu Accéder directement à la navigation
Article dans une revue

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

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 among 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.

Type de document :
Article dans une revue
Liste complète des métadonnées
Contributeur : Okina Univ Angers Connectez-vous pour contacter le contributeur
Soumis le : lundi 1 juin 2020 - 19:56:41
Dernière modification le : mercredi 3 novembre 2021 - 06:07:19

Lien texte intégral




Claire Lefèvre, Christopher Beatrix, Igor Stephan, Laurent Garcia. ASPeRiX, a first-order forward chaining approach for answer set computing. Theory and Practice of Logic Programming, Cambridge University Press (CUP), 2017, 17 (3), pp.266-310. ⟨10.1017/S1471068416000569⟩. ⟨hal-02715057⟩



Consultations de la notice