Parallel instantiation of ASP programs: techniques and experiments
From MaRDI portal
Publication:5299587
DOI10.1017/S1471068411000652zbMATH Open1267.68083arXiv1110.1015OpenAlexW2962859023MaRDI QIDQ5299587FDOQ5299587
Authors: Simona Perri, F. Ricca, Marco Sirianni 
Publication date: 26 June 2013
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
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 latest hardware, featuring multi-core/multi-processor SMP (Symmetric MultiProcessing) technologies. This paper presents some parallel instantiation techniques, including load-balancing and granularity control heuristics, which allow for the effective exploitation of the processing power offered by modern SMP machines. This is confirmed by an extensive experimental analysis herein reported. To appear in Theory and Practice of Logic Programming (TPLP). KEYWORDS: Answer Set Programming, Instantiation, Parallelism, Heuristics
Full work available at URL: https://arxiv.org/abs/1110.1015
Recommendations
- Experimenting with parallelism for the instantiation of ASP programs
- Efficient parallel ASP instantiation via dynamic rewriting
- scientific article; zbMATH DE number 1884396
- Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures
- On demand indexing for the DLV instantiator
Cites Work
- ASSAT: computing answer sets of a logic program by SAT solvers
- Extending and implementing the stable model semantics
- Knowledge Representation, Reasoning and Declarative Problem Solving
- The DLV system for knowledge representation and reasoning
- Unfolding partiality and disjunctions in stable model semantics
- Logic programming and knowledge representation---The A-Prolog perspective
- Title not available (Why is that?)
- Mixed integer programming methods for computing nonmonotonic deductive databases
- Verifying security protocols as planning in logic programming
Cited In (11)
- The Intelligent Grounder of DLV
- Title not available (Why is that?)
- Optimizing Answer Set Computation via Heuristic-Based Decomposition
- Experimenting with parallelism for the instantiation of ASP programs
- Title not available (Why is that?)
- Efficient Computation of the Well-Founded Semantics over Big Data
- Parallel Logic Programming: A Sequel
- Title not available (Why is that?)
- On demand indexing for the DLV instantiator
- Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures
- Efficient parallel ASP instantiation via dynamic rewriting
Uses Software
This page was built for publication: Parallel instantiation of ASP programs: techniques and experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5299587)
