PARLOG: parallel programming in logic
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Distributed processing of logic programs
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
Parallel evaluation of Datalog programs by load sharing
Journal of Logic Programming
Parallel logic programming systems
ACM Computing Surveys (CSUR)
Mixed integer programming methods for computing nonmonotonic deductive databases
Journal of the ACM (JACM)
From concurrent logic programming to concurrent constraint programming
Advances in logic programming theory
ACM Transactions on Database Systems (TODS)
Operating systems (3rd ed.): internals and design principles
Operating systems (3rd ed.): internals and design principles
Proceedings of the 1999 international conference on Logic programming
Declarative problem-solving in DLV
Logic-based artificial intelligence
Hoard: a scalable memory allocator for multithreaded applications
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Parallel execution of prolog programs: a survey
ACM Transactions on Programming Languages and Systems (TOPLAS)
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Extending and implementing the stable model semantics
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Data Partition and Parallel Evaluation of Datalog Programs
IEEE Transactions on Knowledge and Data Engineering
WFS + Branch and Bound = Stable Models
IEEE Transactions on Knowledge and Data Engineering
Experiments in Parallel Execution of Answer Set Programs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Propositional Satisfiability in Answer-Set Programming
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Embedding Negation as Failure into a Model Generation Theorem Prover
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A Declarative Language for Parallel Programming
A Declarative Language for Parallel Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
The INFOMIX system for advanced integration of incomplete and inconsistent data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Operating Systems Design and Implementation (3rd Edition)
Operating Systems Design and Implementation (3rd Edition)
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Issues in parallel execution of non-monotonic reasoning systems
Parallel Computing
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The first answer set programming system competition
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
PLATYPUS: a platform for distributed answer set solving
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The nomore++ approach to answer set solving
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The DLV Project: A Tour from Theory and Research to Applications and Market
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A First Order Forward Chaining Approach for Answer Set Computing
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A parallel ASP instantiator based on DLV
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming
A 25-year perspective on logic programming
Optimizing the distributed evaluation of stratified programs via structural analysis
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
The disjunctive datalog system DLV
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
The intelligent grounder of DLV
Correct Reasoning
Hi-index | 0.00 |
In the last few years, microprocessor technologies have been moving towards multi-core architectures, in order to improve performance as well as reduce power consumption. This makes real Symmetric MultiProcessing (SMP) available even on non-dedicated machines, and paves the way to the development of better performing software. Notably, the recent application of Answer Set Programming (ASP) in different emerging areas, such as knowledge management or information extraction/integration, shows that performance is a crucial issue also for ASP systems. Among the tasks performed by such systems, the instantiation process, which consists of generating a variable-free program equivalent to the input one, is one of the most expensive from a computational viewpoint, especially in the case of huge input data. In this paper a new strategy exploiting parallelism for the instantiation of ASP programs is proposed. An implementation of this strategy and its integration with the grounding module of the DLV system is discussed. The results of an experimental analysis are also presented, which confirm that the strategy is effective in making ASP instantiation more efficient.