Most Answer Set Programming (ASP) systems, including DLV and Smodels, are endowed with an instantiation module. The in-stantiator generates a new program which is equivalent to the input program, but does not contain any variables (i.e., it is ground). Normal (i.e., disjunction-free) stratified programs are completely solved by the instantiator, which generates the output model directly. The instantiation process may be computationally expensive in some cases, and the instantiator is crucial for the efficiency of the entire ASP system. In this paper, we propose to employ join-ordering techniques to improve the instantiation process. We design a new join-ordering method, and adapt a classical database method to this context. We implement these techniques in the ASP system DLV, and we carry out an experimentation activity on a collection of benchmark problems taken from different domains. The results of experiments are very positive, the new techniques improve sensibly the efficiency of the DLV system, whose instantiation module confirms to be a main strong point of DLV w.r.t. the other ASP systems. © Springer-Verlag Berlin Heidelberg 2001.
CITATION STYLE
Leone, N., Perri, S., & Scarcello, F. (2001). Improving ASP instantiators by join-ordering methods. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2173 LNAI, pp. 280–294). https://doi.org/10.1007/3-540-45402-0_21
Mendeley helps you to discover research relevant for your work.