An investigation in parallel execution of answer set programs on distributed memory platforms: Task sharing and dynamic scheduling

Computer Languages, Systems and Structures

Volumn 36, Issue 2, 2010, Pages 158-202

  Pontelli, Enrico ^a   Le, Hung Viet ^a   Son, Tran Cao ^a  

^a New Mexico State University   (United States)

Author keywords

Answer set programming; Logic programming; Parallelism; Scheduling

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; APPLICATION DOMAINS; DISTRIBUTED MEMORY PLATFORMS; DYNAMIC LOAD BALANCING; DYNAMIC SCHEDULING; IRREGULAR STRUCTURES; KNOWLEDGE REPRESENTATION AND REASONING; PARALLEL ENGINES; PARALLEL EXECUTIONS; REAL WORLD DOMAIN; SEARCH TREES; SMODELS; SYSTEMATIC INVESTIGATIONS; TASK SHARING; TWO-COMPONENT;

KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; SCHEDULING;

MULTITASKING;

EID: 72149088233     PISSN: 14778424     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cl.2009.09.001     Document Type: Article

References (76)

1. Apt K.R., and Bol R.N. Logic programming and negation: a survey. Journal of Logic Programming 19/20 (1994) 9-71
2. Balduccini M., Pontelli E., Elkhatib O., and Le H. Issues in parallel execution of non-monotonic reasoning systems. Parallel Computing 31 6 (2005) 608-647
3. Baral C. Knowledge representation, reasoning, and declarative problem solving (2003), Cambridge University Press, Cambridge
4. Baral C., and Gelfond M. Logic programming and knowledge representation. Journal of Logic Programming 19/20 (1994) 73-148
5. Bonatti P, Pontelli E, Son TC. Credulous resolution for answer set programming. In: Proceedings of AAAI, 2008. p. 418-23.
6. Brass S., Dix J., Freitag B., and Zukowski U. Transformation-based bottom-up computation of the well-founded model. Theory and Practice of Logic Programming 1 5 (2001) 497-538
7. Brooks D., Erdem E., Erdogan S., Minett J., and Ringe D. Inferring phylogenetic trees using answer set programming. Journal of Automated Reasoning 39 4 (2007) 471-511
8. Chandra A., and Shenoy P. Hierarchical scheduling for symmetric multiprocessors. IEEE Transactions on Parallel and Distributed Systems 19 3 (2008) 418-431
9. Chassin de Kergommeaux J., and Codognet P. Parallel logic programming systems. ACM Computing Surveys 26 3 (1994) 295-336
10. Chrabakh W., and Wolski R. GridSAT: a system for solving satisfiability problems using a computational grid. Parallel Computing 32 9 (2006) 660-687
11. Clocksin W., and Alshawi H. A method for efficiently executing Horn clause programs using multiple processors. New Generation Computing 5 (1988) 361-376
12. Dandamudi S. Hierarchical scheduling in parallel and cluster systems (2003), Springer, Berlin
13. Dijkstra E., Feijen W., and van Gasteren A. Derivation of a termination detection algorithm for distributed computations. Information Processing Letters 16 (1983) 217-219
14. Dovier A., Formisano A., and Pontelli E. GASP: answer set programming with lazy grounding. Proceedings of the international conference on logic programming (2009), Springer, Berlin
15. Dowling W., and Gallier J. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming 3 (1984) 267-289
16. Dworschak S., Grell S., Nikiforova V., Schaub T., and Selbig J. Modeling biological networks by action languages via answer set programming. Constraints 13 1-2 (2008) 21-65
17. Eager D.L., Lazowska E.D., and Zahorjan J. Adaptive load sharing in homogeneous distributed systems. IEEE Transactions on Software Engineering 12 5 (1986) 662-675
18. Eager D.L., and Lazowska E.D. A comparison of receiver-initiated and sender-initiated adaptive load sharing. Performance Evaluation 6 (1986) 53-68
19. Eiter T., Faber W., Leone N., and Pfeifer G. Declarative problem-solving using the DLV system. In: Minker J. (Ed). Logic-based artificial intelligence (2000), Kluwer Academic Publishers, Dordrecht 79-103
20. Erdem E., Lifschitz V., Nakhleh L., and Ringe D. Reconstructing the evolutionary history of Indo-European languages using answer set programming. Practical aspects of declarative languages (2003), Springer, Berlin 160-176
21. Erdem E., Lifschitz V., and Ringe D. Temporal phylogenetic networks and logic programming. Theory and Practice of Logic Programming 6 5 (2006) 539-558
22. Feldman Y, Dershowitz N, Hanna Z. Parallel multithreaded satisfiability solvers: design and implementation. In: Electronic notes on theoretical computer science vol. 128, no. 3, 2005. p. 75-90.
23. Finkel R, Marek V, Moore N, Truszczyński M. Computing stable models in parallel. In: AAAI spring symposium on answer set programming, 2001. p. 72-5.
24. Gebser M., Kaufmann B., Neumann A., and Schaub T. clasp: a conflict-driven answer set solver. Logic programming and non-monotonic reasoning (2007), Springer, Berlin 260-265
25. Gelfond M. The USA-Advisor: a case study in answer set programming. Logics in artificial intelligence (2002), Springer, Berlin 566-568
26. Gelfond M., and Leone N. Logic programming and knowledge representation-the A-Prolog perspective. Artificial Intelligence Journal 138 (2002) 3-38
27. Gelfond M., and Lifschitz V. The stable model semantics for logic programs. International symposium on logic programming (1988), MIT Press, Cambridge 1070-1080
28. Gelfond M., and Lifschitz V. Classical negation in logic programs and disjunctive databases. New Generation Computing 9 3/4 (1991) 365-386
29. Giunchiglia E., Lierler Y., and Maratea M. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36 4 (2006) 345-377
30. Grama A., and Kumar V. State of the art in parallel search techniques for discrete optimization problems. IEEE Transactions on Knowledge and Data Engineering 11 1 (1999) 28-35
31. Gressmann J., Janhunen T., Mercer R., Schaub T., Thiele S., and Tichy R. Platypus: a platform for distributed answer set solving. Logic programming and non-monotonic reasoning (2005), Springer 227-239
32. Gressmann J, Janhunen T, Mercer RE, Schaub T, Thiele S, Tichy R. In: On probing and multi-threading in Platypus. European conference on artificial intelligence, 2006. p. 392-6.
33. Grossi G., Marchi M., Pontelli E., and Provetti A. Answer set computation over parallel and distributed architectures. Journal of Logic and Computation 19 (2009) 697-715
34. Gupta G. Multiprocessor execution of logic programs (1994), Kluwer Academic Press, Dordrecht
35. Gupta G., and Jayaraman B. Analysis of or-parallel execution models. ACM Transactions on Programming Languages and Systems 15 4 (1993) 659-680
36. Gupta G., Pontelli E., Carlsson M., Hermenegildo M., and Ali K. Parallel execution of prolog programs: a survey. ACM Transactions on Programming Languages and Systems 23 4 (2001) 472-602
37. Heljanko K., and Niemela I. Bounded LTL model checking with stable models. Logic programming and non-monotonic reasoning (2001), Springer, Berlin 200-212
38. Jaffar J., and Maher M. Constraint logic programming. Journal of Logic Programming 19/20 (1994) 503-581
39. Jurkowiak B, Li C, Utard G. Parallelizing Satz using dynamic workload balancing. In: Workshop on Theory and Applications of Satisfiability Testing, 2001.
40. Lifschitz V. Answer set planning. Logic programming and non-monotonic reasoning (1999), Springer, Berlin 373-374
41. V. Lifschitz, M. Gelfond, The stable model semantics for logic programming, Cambridge, MA. Association for logic programming, MIT Press Proceedings of the Fifth Logic Programming Symposium, 1988. p. 1070-80.
42. Lifschitz V., and Turner H. Splitting a logic program. International conference on logic programming (1994), MIT Press, Cambridge 23-37
43. Lin F., and Zhao Y. ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157 1-2 (2004) 115-137
44. Lloyd J. Foundations of logic programming (1987), Springer, Berlin
45. Marek V., and Truszczyński M. Stable models and an alternative logic programming paradigm. In: Apt K., Marek V., Truszcziński M., and Warren D.S. (Eds). The logic programming paradigm (1999), Springer, Berlin 375-398
46. Martins S, Ribeiro C, Souza M. A parallel GRASP for the Steiner problem in graphs. In: Workshop on parallel algorithms for irregularly structured problems, 1998.
47. McIlraith S, Son T, Zeng H. Mobilizing the semantic web with DAML-enabled web services. In: Proceedings of the Second International Workshop on the Semantic Web, 2001.
48. McIlraith S., Son T., and Zeng H. Semantic web services. IEEE Intelligent Systems 16 2 (2001) 46-53
49. Michel L., See A., and Van Hentenryck P. Parallelizing constraint programs transparently. In: Bessiere C. (Ed). Principles and practice of constraint programming (2007), Springer, Berlin 514-528
50. Mileo A., and Schaub T. Qualitative constraint enforcement in advanced policy specification. ECSQARU (2007), Springer, Berlin 695-706
51. Minker J. An overview of non-monotonic reasoning and logic programming. Journal of Logic Programming 17 2-4 (1993) 95-126
52. Niemela I. Logic programs with stable model semantics as constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25 3-4 (1999) 241-273
53. Niemela I., and Simons P. Smodels-an implementation of the stable model and well-founded semantics for normal LP. Logic programming and non-monotonic reasoning (1997), Springer, Berlin 421-430
54. Nogueira M., Balduccini M., Gelfond M., Watson R., and Barry M. An A-Prolog decision support system for the space shuttle. Practical aspects of declarative languages (2001), Springer, Berlin 169-183
55. Perron L. Search procedures and parallelism in constraint programming. In: Jaffar J. (Ed). Proceedings of the international conference on principles and practice of constraint programming (1999), Springer, Berlin 346-360
56. Peterson J., Trifonov V., and Serjantov A. Parallel functional reactive programming. Practical aspects of declarative languages (2000), Springer, Berlin 16-31
57. Peyton-Jones S, Lehchinskiy R, Keller G, Chakravarty MT. Harnessing the multicores: nested data parallelism in Haskell. In: Foundations of software technology and theoretical computer science, Dagstuhl seminar proceedings, IBFI, 2008.
58. Platzner M., and Micheli G.D. Acceleration of satisfiability algorithms by reconfigurable hardware. Proceedings of the 8th international workshop on FPL (1998), Springer, Berlin 69-78
59. Pontelli E. Experiments in parallel execution of answer set programs. International parallel and distributed processing symposium (2001), IEEE Computer Society 20-27
60. Pontelli E., and Son T. Justifications for logic programs under answer set semantics. International conference on logic programming (2006), Springer, Berlin 196-210
61. Schnor B. Dynamic scheduling of parallel applications (1995), Springer, Berlin
62. Schubert T, Lewis M, Becker B. PaMira: a parallel SAT solver with knowledge sharing. In: International workshop on microprocessor test and verification, 2005. p. 29-36.
63. Schulte C. Parallel search made simple. Technical Report, University of Singapore, 2000.
64. Simons P. Extending the stable model semantics with more expressive rules. Logic programming and non-monotonic reasoning (1999), Springer, Berlin 305-316
65. Simons P. Extending and implementing the stable model semantics. PhD thesis, Helsinki University of Technology, Laboratory for Theoretical Computer Science; 2000.
66. Sinz C, Blochinger W, Küchlin W. PaSAT: parallel SAT-checking with lemma exchange: implementation and applications. In: Proceedings of SAT2001, workshop on theory and applications of satisfiability testing, 2001. p. 205-16.
67. Sinz C., Blochinger W., and Küchlin W. Parallel propositional satisfiability checking with distributed dynamic learning. Parallel Computing 29 7 (2003) 969-994
68. Sterling L., and Shapiro E. The art of prolog (1994), MIT Press, Cambridge
69. Suyama T., Yokoo M., Sawada H., and Nagoya A. Solving satisfiability problems using reconfigurable computing. IEEE Transactions on VLSI Systems 9 1 (2001) 109-116
70. Tantawi A.N., and Towsley D. Optimal static load balancing in distributed computer systems. Journal of the ACM 32 2 (1985) 445-465
71. Tu PH, Pontelli E, Son TC, To TS. Applications of parallel processing technologies in heuristic search planning. Concurrency and Computation, to appear.
72. Villaverde K, Pontelli E. An investigation of scheduling in distributed constraint logic programming. In: International conference on parallel and distributed computing systems, 2004. p. 98-123.
73. Wilkinson B., and Allen M. Parallel programming (1999), Prentice-Hall, Englewood Cliffs, NJ
74. Zhang H., Bonacina M., and Hsiang H. PSATO: a distributed propositional prover and its application to quasigroup problems. Journal of Symbolic Computation 21 (1996) 543-560
75. Zoeteweij P., and Arbab F. A component-based parallel constraint solver. Coordination models and languages (2004), Springer, Berlin 307-322
76. Zomaya A.Y., and Yee-Hwei T. Observations on using genetic algorithms for dynamic load-balancing. IEEE Transactions on Parallel and Distributed Systems 12 9 (2001) 899-911