{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T11:51:20Z","timestamp":1676980280722},"reference-count":27,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2012,9,5]],"date-time":"2012-09-05T00:00:00Z","timestamp":1346803200000},"content-version":"unspecified","delay-in-days":66,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2012,7]]},"abstract":"Abstract<\/jats:title>Answer Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs and efficient solvers. To enable access to external information,hex<\/jats:sc>-programs extend programs withexternal atoms<\/jats:italic>, which allow for a bidirectional communication between the logic program and external sources of computation (e.g., description logic reasoners and Web resources). Current solvers evaluatehex<\/jats:sc>-programs by a translation to ASP itself, in which values of external atoms are guessed and verified after the ordinary answer set computation. This elegant approach does not scale with the number of external accesses in general, in particular in presence of nondeterminism (which is instrumental for ASP). In this paper, we present a novel, native algorithm for evaluatinghex<\/jats:sc>-programs which uses learning techniques. In particular, we extend conflict-driven ASP solving techniques, which prevent the solver from running into the same conflict again, from ordinary tohex<\/jats:sc>-programs. We show how to gain additional knowledge from external source evaluations and how to use it in a conflict-driven algorithm. We first target the uninformed case, i.e., when we have no extra information on external sources, and then extend our approach to the case where additional meta-information is available. Experiments show that learning from external sources can significantly decrease both the runtime and the number of considered candidate compatible sets.<\/jats:p>","DOI":"10.1017\/s1471068412000233","type":"journal-article","created":{"date-parts":[[2012,9,5]],"date-time":"2012-09-05T11:28:45Z","timestamp":1346844525000},"page":"659-679","source":"Crossref","is-referenced-by-count":13,"title":["Conflict-driven ASP solving with external sources"],"prefix":"10.1017","volume":"12","author":[{"given":"THOMAS","family":"EITER","sequence":"first","affiliation":[]},{"given":"MICHAEL","family":"FINK","sequence":"additional","affiliation":[]},{"given":"THOMAS","family":"KRENNWALLNER","sequence":"additional","affiliation":[]},{"given":"CHRISTOPH","family":"REDL","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2012,9,5]]},"reference":[{"key":"S1471068412000233_ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068412000233_ref7","first-page":"329","volume-title":"KR'10","author":"Eiter","year":"2010"},{"key":"S1471068412000233_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.004"},{"key":"S1471068412000233_ref6","first-page":"93","volume-title":"LPNMR'11","author":"Eiter","year":"2011"},{"key":"S1471068412000233_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.002"},{"key":"S1471068412000233_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"S1471068412000233_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068412000233_ref14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","article-title":"Potassco: The Potsdam answer set solving collection","volume":"24","author":"Gebser","year":"2011","journal-title":"AI Communications"},{"key":"S1471068412000233_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00186-8"},{"key":"S1471068412000233_ref25","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"S1471068412000233_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.04.002"},{"key":"S1471068412000233_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-009-9111-3"},{"key":"S1471068412000233_ref4","first-page":"602","volume-title":"ECSQARU'09","author":"Dao-Tran","year":"2009"},{"key":"S1471068412000233_ref13","first-page":"51","article-title":"Consistency of clark's completion and existence of stable models","volume":"1","author":"Fages","year":"1994","journal-title":"J. Meth. Logic Comp. Sci."},{"key":"S1471068412000233_ref26","doi-asserted-by":"crossref","unstructured":"Ostrowski M. and Schaub T. 2012. ASP modulo CSP: The clingcon system. Theor. Pract. Log. Prog., Special Issue 28th Intl. Conf. Logic Programming. To appear.","DOI":"10.1017\/S1471068412000142"},{"key":"S1471068412000233_ref11","first-page":"273","volume-title":"ESWC'06","author":"Eiter","year":"2006"},{"key":"S1471068412000233_ref5","first-page":"422","volume-title":"KR'08","author":"Drescher","year":"2008"},{"key":"S1471068412000233_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9033-2"},{"key":"S1471068412000233_ref3","volume-title":"Handbook of Satisfiability","author":"Biere","year":"2009"},{"key":"S1471068412000233_ref10","first-page":"90","volume-title":"IJCAI'05","author":"Eiter","year":"2005"},{"key":"S1471068412000233_ref1","first-page":"385","volume-title":"AAAI'07","author":"Brewka","year":"2007"},{"key":"S1471068412000233_ref15","unstructured":"Gebser M. , Kaufmann B. and Schaub T. 2012. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187-188, 52\u201389."},{"key":"S1471068412000233_ref16","first-page":"235","volume-title":"ICLP'09","author":"Gebser","year":"2009"},{"key":"S1471068412000233_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.10.007"},{"key":"S1471068412000233_ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068412000233_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"S1471068412000233_ref24","first-page":"227","volume-title":"LPAR'06","author":"Motik","year":"2006"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068412000233","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T07:20:58Z","timestamp":1643354458000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068412000233\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":27,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S1471068412000233"],"URL":"https:\/\/doi.org\/10.1017\/s1471068412000233","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}