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
Communication dans un congrès

Integrating Grounding in the Search Process for Answer Set Computing

Abstract :

Answer Set Programming (ASP) is a very convenient paradigmto represent knowledge in Artificial Intelligence and to encode Constraint Satisfaction Problems. For that, the natural way to use ASP is to elaborate a first order logic program with default negation encoding the problem to solve. In a preliminary step this program 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 (models) of the program, each answer set encoding one solution of the initial problem. Today, we can say that almost all ASP solvers follow this approach of two steps computation. In this work, we begin by putting in evidence that sometimes the preliminary grounding phase is the only bottleneck for the answer set computation. We show that a lot of useless and counterintuitive work is done in some situations. But, our major contribution is to introduce a new approach of answer set computing that escapes the preliminary phase of rule instantiation by integrating it in the search process. Furthermore, we describe the main lines of the first implementation of our new ASP solver ASPeRiX developed following the introduced methodology.

Type de document :
Communication dans un congrès
Liste complète des métadonnées
Contributeur : Okina Univ Angers Connectez-vous pour contacter le contributeur
Soumis le : mardi 21 septembre 2021 - 14:34:50
Dernière modification le : mercredi 20 octobre 2021 - 03:19:09


  • HAL Id : hal-03350619, version 1
  • OKINA : ua4485



Claire Lefevre, Pascal Nicolas. Integrating Grounding in the Search Process for Answer Set Computing. Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2008), ICLP 2008, 2008, Udine, Italy. pp.89 - 103. ⟨hal-03350619⟩



Consultations de la notice