Answer Set Programming (ASP) is a purely-declarative logic programming language allowing for disjunction and nonmonotonic negation. The evaluation of ASP Programs is traditionally carried out in two steps. In the first step an input program P undergoes the so-called instantiation (or grounding) process, which produces a program P′ semantically equivalent to V, but not containing any variable; in turn, P′ is evaluated by using a backtracking search algorithm in the second step. This paper presents a new parallel version of the instantiator of DLV, featuring new load-balancing and granularity control heuristics, which is able to exploit the processing power offered by multi-core/multi-processor SMP machines.
Parallel Instantiation in DLV
PERRI, Simona;RICCA, Francesco;
2010-01-01
Abstract
Answer Set Programming (ASP) is a purely-declarative logic programming language allowing for disjunction and nonmonotonic negation. The evaluation of ASP Programs is traditionally carried out in two steps. In the first step an input program P undergoes the so-called instantiation (or grounding) process, which produces a program P′ semantically equivalent to V, but not containing any variable; in turn, P′ is evaluated by using a backtracking search algorithm in the second step. This paper presents a new parallel version of the instantiator of DLV, featuring new load-balancing and granularity control heuristics, which is able to exploit the processing power offered by multi-core/multi-processor SMP machines.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
