One of the most hard tasks performed by Answer Set Programming (ASP) systems is instantiation, which consists of generating variable-free programs equivalent to those given as input. The efficiency of this task is crucial for ASP systems performance especially in case of real-world applications where huge inputs are processed. We recently proposed a method that exploits the capabilities of multi-processor machines for the instantiation. This method confirmed to be effective especially when dealing with programs consisting of many rules. Here, we report some preliminary results on a rewriting-based strategy that makes the existing technique exploitable even in case of programs with few rules.
Increasing Parallelism while Instantiating ASP Programs
CALIMERI, Francesco;PERRI, Simona;RICCA, Francesco
2008-01-01
Abstract
One of the most hard tasks performed by Answer Set Programming (ASP) systems is instantiation, which consists of generating variable-free programs equivalent to those given as input. The efficiency of this task is crucial for ASP systems performance especially in case of real-world applications where huge inputs are processed. We recently proposed a method that exploits the capabilities of multi-processor machines for the instantiation. This method confirmed to be effective especially when dealing with programs consisting of many rules. Here, we report some preliminary results on a rewriting-based strategy that makes the existing technique exploitable even in case of programs with few rules.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.