{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T01:03:30Z","timestamp":1768439010781,"version":"3.49.0"},"publisher-location":"Cham","reference-count":90,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319635156","type":"print"},{"value":"9783319635163","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-63516-3_7","type":"book-chapter","created":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T03:43:39Z","timestamp":1522899819000},"page":"237-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Parallel Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Agostino","family":"Dovier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Formisano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,6]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Afrati FN, Ullman JD (2010) Optimizing joins in a map-reduce environment. In: Proc. of 13th International Conference on Extending Database Technology, pp 99\u2013110","DOI":"10.1145\/1739041.1739056"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Afrati FN, Borkar VR, Carey MJ, Polyzotis N, Ullman JD (2011) Map-reduce extensions and recursive queries. In: 14th International Conference on Extending Database Technology, pp 1\u20138","DOI":"10.1145\/1951365.1951367"},{"key":"7_CR3","unstructured":"Apache Software Foundation (2016) Apache Hadoop. http:\/\/hadoop.apache.org"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Apt K, Bol R (1994) Logic Programming and Negation: A Survey. Journal of Logic Programming 19\/20:9\u201371","DOI":"10.1016\/0743-1066(94)90024-8"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Apt K, Blair H, Walker A (1989) Towards a Theory of Declarative Knowledge. In: Minker J (ed) Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Balduccini M, Pontelli E, Elkhatib O, Le H (2005) Issues in Parallel Execution of Non-Monotonic Reasoning Systems. Parallel Computing 31(6):608\u2013647","DOI":"10.1016\/j.parco.2005.03.004"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Baral C (2003) Knowledge representation, reasoning and declarative problem solving. Cambridge University Press","DOI":"10.1017\/CBO9780511543357"},{"key":"7_CR8","unstructured":"Biere A, Heule M, Van Maaren H, Walsh T (eds) (2009) Handbook of Satisfiability. IOS Press"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Bu Y, Howe B, Balazinska M, Ernst M (2010) Haloop: efficient iterative data processing on large clusters. In: Very Large Data Bases (VLDB) Conference, ACM, pp 285\u2013296","DOI":"10.14778\/1920841.1920881"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Calimeri F, Perri S, Ricca F (2008) Experimenting with parallelism for the instantiation of ASP programs. Journal of Algorithms 63(1-3):34\u201354","DOI":"10.1016\/j.jalgor.2008.02.003"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Ceri S, Gottlob G, Tanca L (1990) Logic Programming and Databases. Springer","DOI":"10.1007\/978-3-642-83952-8"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Clark K (1978) Negation as failure. In: Gallaire H, Minker J (eds) Logic and Data Bases, Plenum","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Dal Pal\u00f9 A, Dovier A, Formisano A, Pontelli E (2015) CUD@SAT: SAT solving on GPUs. J Exp Theor Artif Intell 27(3):293\u2013316","DOI":"10.1080\/0952813X.2014.954274"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Dantsin E, Eiter T, Gottlob G, Voronkov A (2001) Complexity and expressive power of logic programming. ACM Comput Surv 33(3):374\u2013425","DOI":"10.1145\/502807.502810"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Davis M, Putnam H (1960) A Computing Procedure for Quantification Theory. Journal of the ACM 7:201\u2013215","DOI":"10.1145\/321033.321034"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Davis M, Logemann G, Loveland D (1962) A machine program for theorem proving. Communications of the ACM 5(7):394\u2013397","DOI":"10.1145\/368273.368557"},{"key":"7_CR17","unstructured":"Dean J, Ghemawat S (2004) MapReduce: Simplified Data Processing on Large Clusters. Tech. rep., Google, Inc."},{"key":"7_CR18","unstructured":"Dovier A, Formisano A, Pontelli E, Vella F (2015) Parallel Execution of the ASP Computation - an Investigation on GPUs. In: Proceedings of the Technical Communications of the 31st International Conference on Logic Programming, CEUR-WS.org, no. 1433 in CEUR Workshop Proceedings"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Dovier A, Formisano A, Pontelli E, Vella F (2016) A GPU implementation of the ASP computation. In: Gavanelli M, Reppy JH (eds) Practical Aspects of Declarative Languages - 18th International Symposium, PADL 2016. Proceedings, Springer, Lecture Notes in Computer Science, vol 9585, pp 30\u201347","DOI":"10.1007\/978-3-319-28228-2_3"},{"key":"7_CR20","unstructured":"El-Khatib O, Pontelli E (2000) Parallel Evaluation of Answer Sets Programs Preliminary Results. In: Workshop on Parallelism and Implementation of Logic Programming"},{"key":"7_CR21","unstructured":"Fages F (1994) Consistency of Clark\u2019s completion and existence of stable models. Methods of Logic in Computer Science 1(1):51\u201360"},{"key":"7_CR22","unstructured":"Finkel R, Marek V, Moore N, Truszczy\u0144ski M (2001) Computing Stable Models in Parallel. In: Provetti A, Tran S (eds) Proceedings of the AAAI Spring Symposium on Answer Set Programming, AAAI\/MIT Press, Cambridge, MA, pp 72\u201375"},{"key":"7_CR23","unstructured":"Formisano A, Vella F (2014) On multiple learning schemata in conflict driven solvers. In: Bistarelli S, Formisano A (eds) Proceedings of the 15th Italian Conference on Theoretical Computer Science, CEUR-WS.org, CEUR Workshop Proceedings, vol 1231, pp 133\u2013146"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Ganguly S, Silberschatz A, Tsur S (1990) A Framework for the Parallel Processing of Datalog Queries. In: Garcia-Molina H, Jagadish H (eds) Proceedings of ACM SIGMOD Conference on Management of Data, ACM Press, New York, pp 143\u2013152","DOI":"10.1145\/93597.98724"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Ganguly S, Silberschatz A, Tsur S (1992) Parallel Bottom-Up Processing of Datalog Queries. Journal of Logic Programming 14(1-2):101\u2013126","DOI":"10.1016\/0743-1066(92)90048-8"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Gebser M, Kaminski R, Kaufmann B, Schaub T, Schneider MT, Ziller S (2011) A portfolio solver for answer set programming: Preliminary report. In: Delgrande JP, Faber W (eds) Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings, Springer, Lecture Notes in Computer Science, vol 6645, pp 352\u2013357","DOI":"10.1007\/978-3-642-20895-9_40"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Gebser M, Kaminski R, Kaufmann B, Schaub T (2012) Answer Set Solving in Practice. Morgan and Claypool Publishers","DOI":"10.2200\/S00457ED1V01Y201211AIM019"},{"key":"7_CR28","unstructured":"Gebser M, Kaminski R, Kaufmann B, Schaub T (2014) Clingo = ASP + control: Preliminary report. CoRR http:\/\/arXiv.org\/abs\/1405.3694"},{"key":"7_CR29","unstructured":"Gelfond M (2007) Answer sets. In: Handbook of Knowledge Representation. Chapter 7, Elsevier"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Gelfond M, Kahl Y (2014) Knowledge Representation, Reasoning, and the Design of Intelligent Agents The Answer-Set Programming Approach. Cambridge University Press","DOI":"10.1017\/CBO9781139342124"},{"key":"7_CR31","unstructured":"Gelfond M, Lifschitz V (1988) The Stable Model Semantics for Logic Programs. In: International Symposium on Logic Programming, MIT Press, pp 1070\u20131080"},{"key":"7_CR32","unstructured":"Giunchiglia E, Lierler Y, Maratea M (2006) Answer set programming based on propositional satisfiability. J Autom Reasoning 36(4):345\u2013377"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Goldberg E, Novikov Y (2007) BerkMin: A fast and robust SAT-solver. Discrete Applied Mathematics 155(12):1549\u20131561","DOI":"10.1016\/j.dam.2006.10.007"},{"key":"7_CR34","unstructured":"Gonzalez JE, Xin RS, Dave A, Crankshaw D, Franklin MJ, Stoica I (2014) GraphX: Graph Processing in a Distributed Dataflow Framework. In: Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation, USENIX"},{"key":"7_CR35","unstructured":"Grossi G, Marchi M, Pontelli E, Provetti A (2008) Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures. Journal of Logic and Computation 19(4):697\u2013715"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Gupta G, Pontelli E, Carlsson M, Hermenegildo M, Ali K (2001) Parallel Execution of Prolog Programs: a Survey. ACM Transactions on Programming Languages and Systems 23(4):472\u2013602","DOI":"10.1145\/504083.504085"},{"key":"7_CR37","unstructured":"Hayes PJ, Kowalski RA (1969) Semantic trees in automatic theorem proving. Machine lntelligence 4:87\u2013101"},{"key":"7_CR38","unstructured":"Heule M, van Maaren H (2009) Look-ahead Based SAT Solvers. In: Handbook of Satisfiability, IOS Press, chap 5, pp 155\u2013184"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Hoos H, Lindauer MT, Schaub T (2014) claspfolio 2: Advances in algorithm selection for answer set programming. TPLP 14(4-5):569\u2013585","DOI":"10.1017\/S1471068414000210"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Jenkins J, Arkatkar I, Owens JD, Choudhary AN, Samatova NF (2011) Lessons Learned from Exploring the Backtracking Paradigm on the GPU. In: Proc. of Euro-Par 2011, Springer Verlag, pp 425\u2013437","DOI":"10.1007\/978-3-642-23397-5_42"},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Jeroslow RG, Wang J (1990) Solving propositional satisfiability problems. Ann Math Artif Intell 1:167\u2013187","DOI":"10.1007\/BF01531077"},{"key":"7_CR42","unstructured":"Khronos Group Inc (2015) OpenCL: The open standard for parallel programming of heterogeneous systems. http:\/\/www.khronos.org"},{"key":"7_CR43","unstructured":"Kowalski RA (1970) Search strategies for theorem-proving. Machine Intelligence 5:181\u2013201"},{"key":"7_CR44","unstructured":"Kowalski RA (1974) Predicate Logic as a Programming Language. In: Proceedings IFIPS, pp 569\u2013574"},{"key":"7_CR45","doi-asserted-by":"crossref","unstructured":"Lassez J, Jaffar J (1987) Constraint logic programming. In: Proc. 14th ACM POPL","DOI":"10.1145\/41625.41635"},{"key":"7_CR46","doi-asserted-by":"crossref","unstructured":"Le H, Pontelli E (2005) An Investigation of Sharing Strategies for Answer Set Solvers and SAT Solvers. In: Euro-Par, Springer Verlag, pp 750\u2013760","DOI":"10.1007\/11549468_82"},{"key":"7_CR47","unstructured":"Le H, Pontelli E (2007) Dynamic Scheduling in Parallel Answer Set Programming Solvers. In: High Performance Computing Symposium, ACM Press, pp 367\u2013374"},{"key":"7_CR48","doi-asserted-by":"crossref","unstructured":"Leone N, Perri S, Scarcello F (2001) Improving ASP instantiators by joinordering methods. In: Logic Programming and Non-Monotonic Reasoning, Springer Verlag, pp 280\u2013294","DOI":"10.1007\/3-540-45402-0_21"},{"key":"7_CR49","doi-asserted-by":"crossref","unstructured":"Leone N, Pfeifer G, Faber W, Eiter T, Gottlob G, Perri S, Scarcello F (2006) The DLV system for knowledge representation and reasoning. ACM Trans Comput Log 7(3):499\u2013562","DOI":"10.1145\/1149114.1149117"},{"key":"7_CR50","unstructured":"Lierler Y, Maratea M (2004) Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. In: Lifschitz V, Niemel\u00e4 I (eds) Proceedings of the 7th International Conference on Logic Programming and NonMonotonic Reasoning Conference (LPNMR\u201904), Springer Verlag, vol 2923, pp 346\u2013350"},{"key":"7_CR51","doi-asserted-by":"crossref","unstructured":"Lin F, Zhao Y (2004) ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. Artificial Intelligence 157(1):115\u2013137","DOI":"10.1016\/j.artint.2004.04.004"},{"key":"7_CR52","doi-asserted-by":"crossref","unstructured":"Lindauer MT, Hoos HH, Hutter F, Schaub T (2015) Autofolio: An automatically configured algorithm selector. J Artif Intell Res (JAIR) 53:745\u2013778","DOI":"10.1613\/jair.4726"},{"key":"7_CR53","doi-asserted-by":"crossref","unstructured":"Liu L, Pontelli E, Son TC, Truszczy\u0144skiM(2010) Logic programs with abstract constraint atoms: The role of computations. Artificial Intelligence 174(3-4):295\u2013315","DOI":"10.1016\/j.artint.2009.11.016"},{"key":"7_CR54","doi-asserted-by":"crossref","unstructured":"Lloyd J (1987) Foundations of Logic Programming. Springer-Verlag, Heidelberg","DOI":"10.1007\/978-3-642-83189-8"},{"key":"7_CR55","doi-asserted-by":"crossref","unstructured":"Low Y, Bickson D, Gonzalez J, Guestrin C, Kyrola A, Hellerstein JM (2012) Distributed GraphLab: a framework for machine learning and data mining in the cloud. Journal of the Proceedings of the VLDB Endowment 5(8):716\u2013727","DOI":"10.14778\/2212351.2212354"},{"key":"7_CR56","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJC, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, ACM Press","DOI":"10.1145\/1807167.1807184"},{"key":"7_CR57","doi-asserted-by":"crossref","unstructured":"Maratea M, Pulina L, Ricca F (2013) Automated selection of grounding algorithm in answer set programming. In: Baldoni M, Baroglio C, Boella G, Micalizio R (eds) AI*IA 2013: Advances in Artificial Intelligence - XIIIth International Conference of the Italian Association for Artificial Intelligence, Turin, Italy, December 4-6, 2013. Proceedings, Springer, Lecture Notes in Computer Science, vol 8249, pp 73\u201384","DOI":"10.1007\/978-3-319-03524-6_7"},{"key":"7_CR58","doi-asserted-by":"crossref","unstructured":"Maratea M, Pulina L, Ricca F (2014) A multi-engine approach to answer-set programming. TPLP 14(6):841\u2013868","DOI":"10.1017\/S1471068413000094"},{"key":"7_CR59","doi-asserted-by":"crossref","unstructured":"Maratea M, Pulina L, Ricca F (2015) Multi-engine ASP solving with policy adaptation. J Log Comput 25(6):1285\u20131306","DOI":"10.1093\/logcom\/ext068"},{"key":"7_CR60","doi-asserted-by":"crossref","unstructured":"Marek V, Truszczy\u0144ski M (1999) Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm, Springer Verlag, pp 375\u2013398","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"7_CR61","doi-asserted-by":"crossref","unstructured":"Marek W, Truszczy\u0144ski M (1991) Autoepistemic Logic. Journal of the ACM 38(3):588\u2013619","DOI":"10.1145\/116825.116836"},{"key":"7_CR62","doi-asserted-by":"crossref","unstructured":"Marques Silva JP, Sakallah KA (1999) GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers 48(5):506\u2013521","DOI":"10.1109\/12.769433"},{"key":"7_CR63","doi-asserted-by":"crossref","unstructured":"Martinez-Angeles CA, de Castro Dutra I, Costa VS, Buenabad-Ch\u00e1vez J (2014) A Datalog engine for GPUs. In: Hanus M, Rocha R (eds) Declarative Programming and Knowledge Management - Declarative Programming Days, KDPD 2013, Unifying INAP, WFLP, and WLP, Kiel, Germany, September 11-13, 2013, Revised Selected Papers, Springer, Lecture Notes in Computer Science, vol 8439, pp 152\u2013168","DOI":"10.1007\/978-3-319-08909-6_10"},{"key":"7_CR64","doi-asserted-by":"crossref","unstructured":"Niemel\u00e4 I (1999) Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and AI 25","DOI":"10.1023\/A:1018930122475"},{"key":"7_CR65","unstructured":"Niemel\u00e4 I, Simons P (1996) Efficient Implementation of the Well-founded and Stable Model Semantics. In: Joint International Conference and Symposium on Logic Programming, MIT Press, pp 289\u2013303"},{"key":"7_CR66","unstructured":"Niemel\u00e4 I, Simons P (1997) Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP. In: Logic Programming and Non-monotonic Reasoning, Springer Verlag, pp 421\u2013430"},{"key":"7_CR67","unstructured":"NVIDIA Corporation (2015) NVIDIA CUDA Zone. https:\/\/developer.nvidia.com\/cuda-zone"},{"key":"7_CR68","doi-asserted-by":"crossref","unstructured":"Perri S, Ricca F, Sirianni M (2013) Parallel instantiation of ASP programs: techniques and experiments. Theory and Practice of Logic Programming 13(2):253\u2013278","DOI":"10.1017\/S1471068411000652"},{"key":"7_CR69","unstructured":"Pollard GH (1981) Parallel execution of Horn clause programs. PhD thesis, Imperial College, London, Dept. of Computing"},{"key":"7_CR70","unstructured":"Pontelli E, El-Khatib O (2001) Exploiting Vertical Parallelism from Answer Set Programs. In: AAAI Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning"},{"key":"7_CR71","doi-asserted-by":"crossref","unstructured":"Pontelli E, Ranjan D, Dal Pal\u00f9 A (2002) An Optimal Data Structure to Handle Dynamic Environments in Non-Deterministic Computations. Computer Languages 28(2):181\u2013201","DOI":"10.1016\/S0096-0551(02)00004-8"},{"key":"7_CR72","doi-asserted-by":"crossref","unstructured":"Pontelli E, Le H, Son T (2010) An Investigation in Parallel Execution of Answer Set Programs on Distributed Memory Platforms. Computer Languages, Systems and Structures\u00a036(2):158\u2013202","DOI":"10.1016\/j.cl.2009.09.001"},{"key":"7_CR73","doi-asserted-by":"crossref","unstructured":"Ranjan D, Pontelli E, Gupta G (1999) On the Complexity of Or-Parallelism. New Generation Computing 17(3):285\u2013308","DOI":"10.1007\/BF03037223"},{"key":"7_CR74","unstructured":"Rao J, Ross KA (1999) Cache conscious indexing for decision-support in main memory. In: Atkinson MP, Orlowska ME, Valduriez P, Zdonik SB, Brodie ML (eds) VLDB\u201999, Proceedings of 25th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK, Morgan Kaufmann, pp 78\u201389"},{"key":"7_CR75","doi-asserted-by":"crossref","unstructured":"Shepherdson J (1989) Negation in Logic Programming. In: Minker J (ed) Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"key":"7_CR76","unstructured":"Silverthorn B, Lierler Y, Schneider M (2012) Surviving solver sensitivity: An ASP practitioner\u2019s guide. In: Dovier A, Costa VS (eds) Technical Communications of the 28th International Conference on Logic Programming, ICLP 2012, September 4-8, 2012, Budapest, Hungary, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs, vol 17, pp 164\u2013175"},{"key":"7_CR77","doi-asserted-by":"crossref","unstructured":"Simons P, Niemel\u00e4 I, Soininen T (2002) Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2):181\u2013234","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"7_CR78","doi-asserted-by":"crossref","unstructured":"Sunderam V (1990) PVM: a framework for parallel distributed computing. Concurrency: Practice & Experience 2(4)","DOI":"10.1002\/cpe.4330020404"},{"key":"7_CR79","doi-asserted-by":"crossref","unstructured":"Tachmazidis I, Antoniou G (2013) Computing the Stratified Semantics of Logic Programs over Big Data through Mass Parallelization. In: Theory, Practice, and Applications of Rules on the Web - 7th International Symposium, RuleML 2013","DOI":"10.1007\/978-3-642-39617-5_18"},{"key":"7_CR80","unstructured":"Tachmazidis I, Antoniou G, Flouris G, Kotoulas S, McCluskey L (2012) Largescale Parallel Stratified Defeasible Reasoning. In: Proceedings of the European Conference on Artificial Intelligence (ECAI), IOS Press, pp 738\u2013743"},{"key":"7_CR81","doi-asserted-by":"crossref","unstructured":"Tachmazidis I, Antoniou G, Faber W (2014) Efficient Computation of the Well-Founded Semantics over Big Data. Theory and Practice of Logic Programming 14(4-5):445\u2013459","DOI":"10.1017\/S1471068414000131"},{"key":"7_CR82","unstructured":"Ullman JD (1988) Principles of Database and Knowledge-Base Systems. Computer Science Press, Maryland"},{"key":"7_CR83","doi-asserted-by":"crossref","unstructured":"Urbani J, Kotoulas S, Maassen J, van Harmelen F, Bal H (2012) WebPIE: A Web-Scale Parallel Inference Engine using MapReduce. Journal of Web Semantics 10:59\u201375","DOI":"10.1016\/j.websem.2011.05.004"},{"key":"7_CR84","doi-asserted-by":"crossref","unstructured":"Van Gelder A, Ross K, Schlipf J (1991) The Well-Founded Semantics for General Logic Programs. Journal of the ACM 38(3):620\u2013650","DOI":"10.1145\/116825.116838"},{"key":"7_CR85","doi-asserted-by":"crossref","unstructured":"Warren DHD (1980) Logic programming and compiler writing. Software \u2013 Practice and Experience 10(2):97\u2013125","DOI":"10.1002\/spe.4380100203"},{"key":"7_CR86","doi-asserted-by":"crossref","unstructured":"Wolfson O (1988) Sharing the load of logic-program evaluation. In: Jajodia S, Kim W, Silberschatz A (eds) Proceedings of the International Symposium on Databases in Parallel and Distributed Systems, Austin, Texas, USA, December 5-7, 1988, IEEE Computer Society, pp 46\u201355","DOI":"10.1109\/DPDS.1988.675001"},{"key":"7_CR87","doi-asserted-by":"crossref","unstructured":"Wolfson O, Silberschatz A (1988) Distributed Processing of Logic Programs. In: Boral H, Larson P (eds) Proceedings of the SIGMOD International Conference on Management of Data, ACM, ACM Press, New York, pp 329\u2013336","DOI":"10.1145\/50202.50242"},{"key":"7_CR88","doi-asserted-by":"crossref","unstructured":"Xu L, Hutter F, Hoos HH, Leyton-Brown K (2008) Satzilla: Portfolio-based algorithm selection for SAT. J Artif Intell Res (JAIR) 32:565\u2013606","DOI":"10.1613\/jair.2490"},{"key":"7_CR89","unstructured":"Yang M, Shkapsky A, Zaniolo C (2015) Parallel bottom-up evaluation of logic programs: Deals on shared-memory multicore machines. In: De Vos M, Eiter T, Lierler Y, Toni F (eds) Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP) 2015, CEUR-WS.org, CEUR Workshop Proceedings, vol 1433"},{"key":"7_CR90","doi-asserted-by":"crossref","unstructured":"Zhang W, Wang K, Chau SC (1995) Data Partition and Parallel Evaluation of Datalog Programs. IEEE Transactions on Knowledge and Data Engineering 7:163\u2013176","DOI":"10.1109\/69.368511"}],"container-title":["Handbook of Parallel Constraint Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63516-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T12:48:55Z","timestamp":1751546935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63516-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319635156","9783319635163"],"references-count":90,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63516-3_7","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}