{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:01:15Z","timestamp":1747173675424,"version":"3.40.5"},"reference-count":23,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2023,9]]},"abstract":"Abstract<\/jats:title>Answer set programs used in real-world applications often require that the program is usable with different input data. This, however, can often lead to contradictory statements and consequently to an inconsistent program. Causes for potential contradictions in a program are conflicting rules. In this paper, we show how to ensure that a program \n$\\mathcal{P}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> remains non-contradictory given any allowed set of such input data. For that, we introduce the notion of conflict-resolving \n${\\lambda}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-extensions. A conflict-resolving \n${\\lambda}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-extension for a conflicting rule r<\/jats:italic> is a set \n${\\lambda}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> of (default) literals such that extending the body of r<\/jats:italic> by \n${\\lambda}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> resolves all conflicts of r<\/jats:italic> at once. We investigate the properties that suitable \n${\\lambda}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-extensions should possess and building on that, we develop a strategy to compute all such conflict-resolving \n${\\lambda}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-extensions for each conflicting rule in \n$\\mathcal{P}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>. We show that by implementing a conflict resolution process that successively resolves conflicts using \n${\\lambda}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-extensions eventually yields a program that remains non-contradictory given any allowed set of input data.<\/jats:p>","DOI":"10.1017\/s1471068422000357","type":"journal-article","created":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T09:43:40Z","timestamp":1663580620000},"page":"1094-1127","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":1,"title":["On Establishing Robust Consistency in Answer Set Programs"],"prefix":"10.1017","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5679-6931","authenticated-orcid":false,"given":"ANDRE","family":"THEVAPALAN","sequence":"first","affiliation":[]},{"given":"GABRIELE","family":"KERN-ISBERNER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2022,9,19]]},"reference":[{"key":"S1471068422000357_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90013-A"},{"key":"S1471068422000357_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90014-4"},{"key":"S1471068422000357_ref20","unstructured":"Thevapalan, A. , Heyninck, J. and Kern-Isberner, G. 2021. Establish coherence in logic programs modelling expert knowledge via argumentation. In Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021), Porto, Portugal (virtual), 20\u201321 September 2021, J. Arias, F. A. D\u2019Asaro, A. Dyoub, G. Gupta, M. Hecher, E. LeBlanc, R. Pe\u00f1aloza, E. Salazar, A. Saptawijaya, F. Weitk\u00e4mper and J. Zangari, Eds. CEUR Workshop Proceedings, vol. 2970. CEUR-WS.org."},{"key":"S1471068422000357_ref2","unstructured":"Alferes, J. J. , Leite, J. A. , Pereira, L. M. , Przymusinska, H. and Przymusinski, T. C. 1998. Dynamic logic programming. In 1998 Joint Conference on Declarative Programming, APPIA-GULP-PRODE\u201998, A Coru\u00f1a, Spain, 20\u201323 July 1998, J. L. Freire-Nistal, M. Falaschi and M. V. Ferro, Eds., 393\u2013408."},{"key":"S1471068422000357_ref22","first-page":"620","article-title":"The well-founded semantics for general logic programs","volume":"3","author":"van Gelder","year":"1991","journal-title":"Journal of the ACM 38"},{"key":"S1471068422000357_ref7","unstructured":"Caminada, M. and Sakama, C. 2006. On the existence of answer sets in normal extended logic programs. In ECAI 2006, 17th European Conference on Artificial Intelligence, 29 August\u20131 September 2006, Riva del Garda, Italy, Including Prestigious Applications of Intelligent Systems (PAIS 2006), Proceedings, G. Brewka, S. Coradeschi, A. Perini and P. Traverso, Eds. Frontiers in Artificial Intelligence and Applications, vol. 141. IOS Press, 743\u2013744."},{"key":"S1471068422000357_ref17","unstructured":"Schulz, C. 2017. Developments in Abstract and Assumption-based Argumentation and their Application in Logic Programming. Ph.D. thesis, Imperial College London, UK."},{"key":"S1471068422000357_ref6","first-page":"2457","article-title":"Argumentation semantics as formal discussion","volume":"8","author":"Caminada","year":"2017","journal-title":"Journal of Applied Logics 4"},{"key":"S1471068422000357_ref1","doi-asserted-by":"crossref","unstructured":"Abdelhalim, A. , Traor\u00e9, I. and Sayed, B. 2009. RBDT-1: A new rule-based decision tree generation technique. In Rule Interchange and Applications, International Symposium, RuleML 2009, Las Vegas, Nevada, USA, 5\u20137 November 2009. Proceedings, G. Governatori, J. Hall and A. Paschke, Eds. Notes, Lecture in Computer Science, vol. 5858. Springer, 108\u2013121.","DOI":"10.1007\/978-3-642-04985-9_12"},{"key":"S1471068422000357_ref18","doi-asserted-by":"crossref","unstructured":"Schulz, C. , Satoh, K. and Toni, F. 2015. Characterising and explaining inconsistency in logic programs. In Logic Programming and Nonmonotonic Reasoning - 13th International Conference, LPNMR 2015, Lexington, KY, USA, 27\u201330 September 2015. Proceedings, F. Calimeri, G. Ianni and M. Truszczynski, Eds. Notes, Lecture in Computer Science, vol. 9345. Springer, 467\u2013479.","DOI":"10.1007\/978-3-319-23264-5_39"},{"key":"S1471068422000357_ref19","unstructured":"Thevapalan, A. , Haupt, K. and Kern-Isberner, G. 2022. Towards causality-based conflict resolution in answer set programs. In 16th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 2022, Genova Nervi, Italy, 5\u20139 September 2022. Proceedings. Lecture Notes in Computer Science, vol. 13416. Springer. to be published."},{"volume-title":"Commitment in Dialogue: Basic Concepts of Interpersonal Reasoning","year":"1995","author":"Walton","key":"S1471068422000357_ref23"},{"key":"S1471068422000357_ref4","unstructured":"Berge, C. 1989. Hypergraphs - Combinatorics of Finite Sets. North-Holland Mathematical Library, vol. 45. North-Holland."},{"key":"S1471068422000357_ref5","unstructured":"Caminada, M. 2006. Well-founded semantics for semi-normal extended logic programs. In Proc. 11th Int\u2019l Workshop on Nonmonotonic Reasoning, 103\u2013108."},{"key":"S1471068422000357_ref9","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068401001247"},{"key":"S1471068422000357_ref21","unstructured":"Thevapalan, A. and Kern-Isberner, G. 2020. Towards interactive conflict resolution in asp programs. In 18th International Workshop on Non-Monotonic Reasoning, Workshop Notes, M. V. Mart\u00ednez and I. Varzinczak, Eds., 29\u201336."},{"key":"S1471068422000357_ref11","doi-asserted-by":"crossref","unstructured":"Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3\/4, 365\u2013386.","DOI":"10.1007\/BF03037169"},{"key":"S1471068422000357_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00065-5"},{"volume-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning","year":"2012","author":"Gebser","key":"S1471068422000357_ref10"},{"key":"S1471068422000357_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0_6"},{"key":"S1471068422000357_ref13","unstructured":"Inoue, K. 1993. Studies on Abductive and Nonmonotonic Reasoning. Ph.D. thesis, Kyoto University."},{"key":"S1471068422000357_ref12","unstructured":"Ghosh, A. 2004. Understanding medical uncertainty: A primer for physicians. Journal of Association of Physicians of India 52, 739\u2013742."},{"key":"S1471068422000357_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068405002589"}],"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\/S1471068422000357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T03:54:07Z","timestamp":1696996447000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068422000357\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,19]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["S1471068422000357"],"URL":"https:\/\/doi.org\/10.1017\/s1471068422000357","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2022,9,19]]},"assertion":[{"value":"\u00a9 The Author(s), 2022. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}