{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:09:57Z","timestamp":1780355397989,"version":"3.54.1"},"reference-count":15,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T00:00:00Z","timestamp":1476403200000},"content-version":"unspecified","delay-in-days":43,"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":[[2016,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In recent years, several frameworks and systems have been proposed that extend Inductive Logic Programming (ILP) to the Answer Set Programming (ASP) paradigm. In ILP, examples must all be explained by a hypothesis together with a given background knowledge. In existing systems, the background knowledge is the same for all examples; however, examples may be context-dependent. This means that some examples should be explained in the context of some information, whereas others should be explained in different contexts. In this paper, we capture this notion and present a context-dependent extension of the<jats:italic>Learning from Ordered Answer Sets<\/jats:italic>framework. In this extension, contexts can be used to further structure the background knowledge. We then propose a new iterative algorithm, ILASP2i, which exploits this feature to scale up the existing ILASP2 system to learning tasks with large numbers of examples. We demonstrate the gain in scalability by applying both algorithms to various learning tasks. Our results show that, compared to ILASP2, the newly proposed ILASP2i system can be two orders of magnitude faster and use two orders of magnitude less memory, whilst preserving the same average accuracy.<\/jats:p>","DOI":"10.1017\/s1471068416000351","type":"journal-article","created":{"date-parts":[[2016,10,15]],"date-time":"2016-10-15T21:28:20Z","timestamp":1476566900000},"page":"834-848","source":"Crossref","is-referenced-by-count":23,"title":["Iterative Learning of Answer Set Programs from Context Dependent Examples"],"prefix":"10.1017","volume":"16","author":[{"given":"MARK","family":"LAW","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"ALESSANDRA","family":"RUSSO","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"KRYSIA","family":"BRODA","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2016,10,14]]},"reference":[{"key":"S1471068416000351_ref10","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/SASOW.2014.18","volume-title":"Proceedings of the Eighth IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","author":"Poxrucker","year":"2014"},{"key":"S1471068416000351_ref5","volume-title":"Logics in Artificial Intelligence (JELIA 2014)","author":"Law","year":"2014"},{"key":"S1471068416000351_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037227"},{"key":"S1471068416000351_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037089"},{"key":"S1471068416000351_ref1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-662-44923-3_3","volume-title":"Inductive Logic Programming","author":"Athakravi","year":"2014"},{"key":"S1471068416000351_ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1055686.1055687"},{"key":"S1471068416000351_ref15","volume-title":"Machine Learning at the Computing Laboratory","author":"Srinivasan","year":"2001"},{"key":"S1471068416000351_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5512-1"},{"key":"S1471068416000351_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39917-9_21"},{"key":"S1471068416000351_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5353-8"},{"key":"S1471068416000351_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5358-3"},{"key":"S1471068416000351_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5113-y"},{"key":"S1471068416000351_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2008.10.007"},{"key":"S1471068416000351_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31951-8_12"},{"key":"S1471068416000351_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000198"}],"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\/S1471068416000351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T13:18:45Z","timestamp":1692537525000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068416000351\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":15,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["S1471068416000351"],"URL":"https:\/\/doi.org\/10.1017\/s1471068416000351","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9]]}}}