Parallel Instantiation of ASP Programs: Techniques and Experiments
Simona Perri, Francesco Ricca, Marco Sirianni
TL;DR
This paper introduces parallel instantiation techniques for ASP programs that leverage multi-core hardware, improving efficiency in processing large data sets through load balancing and granularity heuristics, validated by extensive experiments.
Contribution
It proposes novel parallel instantiation methods for ASP, incorporating load balancing and granularity heuristics to better utilize modern multi-core processors.
Findings
Parallel techniques significantly reduce instantiation time.
Heuristics improve load distribution across cores.
Experimental results confirm effectiveness on SMP machines.
Abstract
Answer Set Programming (ASP) is a powerful logic-based programming language, which is enjoying increasing interest within the scientific community and (very recently) in industry. The evaluation of ASP programs is traditionally carried out in two steps. At the first step an input program P undergoes the so-called instantiation (or grounding) process, which produces a program P' semantically equivalent to P, but not containing any variable; in turn, P' is evaluated by using a backtracking search algorithm in the second step. It is well-known that instantiation is important for the efficiency of the whole evaluation, might become a bottleneck in common situations, is crucial in several realworld applications, and is particularly relevant when huge input data has to be dealt with. At the time of this writing, the available instantiator modules are not able to exploit satisfactorily the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.