{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T04:09:31Z","timestamp":1685419771296},"reference-count":0,"publisher":"National Library of Serbia","issue":"4","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>Logic Programming languages, such as Prolog, provide a highlevel, declarative\n   approach to programming. Despite the power, flexibility and good performance\n   that Prolog systems have achieved, some deficiencies in Prolog?s evaluation\n   strategy - SLD resolution - limit the potential of the logic programming\n   paradigm. Tabled evaluation is a recognized and powerful technique that\n   overcomes SLD?s susceptibility in dealing with recursion and redundant\n   sub-computations. In a tabled evaluation, there are several points where we\n   may have to choose between different tabling operations. The decision on\n   which operation to perform is determined by the scheduling algorithm. The two\n   most successful tabling scheduling algorithms are local scheduling and\n   batched scheduling. In previous work, we have developed a framework, on top\n   of the Yap Prolog system, that supports the combination of different linear\n   tabling strategies for local scheduling. In this work, we propose the\n   extension of our framework to support batched scheduling. In particular, we\n   are interested in the two most successful linear tabling strategies, the DRA\n   and DRE strategies. To the best of our knowledge, no other Prolog system\n   supports both strategies simultaneously for batched scheduling. Our\n   experimental results show that the combination of the DRA and DRE strategies\n   can effectively reduce the execution time for batched evaluation.<\/jats:p>","DOI":"10.2298\/csis121129066a","type":"journal-article","created":{"date-parts":[[2013,9,30]],"date-time":"2013-09-30T10:45:36Z","timestamp":1380537936000},"page":"1775-1797","source":"Crossref","is-referenced-by-count":0,"title":["Batched evaluation of linear tabled logic programs"],"prefix":"10.2298","volume":"10","author":[{"given":"Miguel","family":"Areias","sequence":"first","affiliation":[{"name":"CRACS & INESC TEC and Faculty of Sciences, University of Porto Rua do Campo Alegre, Porto, Portugal"}]},{"given":"Ricardo","family":"Rocha","sequence":"additional","affiliation":[{"name":"CRACS & INESC TEC and Faculty of Sciences, University of Porto Rua do Campo Alegre, Porto, Portugal"}]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:31:13Z","timestamp":1685349073000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141300066A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013]]}},"URL":"https:\/\/doi.org\/10.2298\/csis121129066a","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}