Integrating Grounding in the Search Process for Answer Set Computing - Université d'Angers Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Integrating Grounding in the Search Process for Answer Set Computing

Résumé

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.

Fichier non déposé

Dates et versions

hal-03350619 , version 1 (21-09-2021)

Identifiants

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

Citer

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⟩

Collections

UNIV-ANGERS LERIA
4 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More