{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T17:06:03Z","timestamp":1767373563062,"version":"3.40.5"},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T00:00:00Z","timestamp":1689033600000},"content-version":"unspecified","delay-in-days":10,"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,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper introduces a framework for assisting policy authors in refining and improving their policies. In particular, we focus on authorization and obligation policies that can be encoded in Gelfond and Lobo\u2019s <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S147106842300011X_inline1.png\"\/><jats:tex-math>\n$\\mathscr{AOPL}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> language for policy specification. We propose a framework that detects the statements that make a policy inconsistent, underspecified, or ambiguous with respect to an action being executed in a given state. We also give attention to issues that arise at the intersection of authorization and obligation policies, for instance when the policy requires an unauthorized action to be executed. The framework is encoded in Answer Set Programming.<\/jats:p>","DOI":"10.1017\/s147106842300011x","type":"journal-article","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T07:18:16Z","timestamp":1689059896000},"page":"832-847","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":5,"title":["An ASP Framework for the Refinement of Authorization and Obligation Policies"],"prefix":"10.1017","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4534-9658","authenticated-orcid":false,"given":"DANIELA","family":"INCLEZAN","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2023,7,11]]},"reference":[{"key":"S147106842300011X_ref2","doi-asserted-by":"crossref","unstructured":"Balduccini, M. , Gelfond, M. , Pontelli, E. and Son, T. C. 2020. An answer set programming framework for reasoning about agents\u2019 beliefs and truthfulness of statements. In Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 69\u201378.","DOI":"10.24963\/kr.2020\/8"},{"year":"2008","author":"Gelfond","key":"S147106842300011X_ref14"},{"key":"S147106842300011X_ref13","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":"S147106842300011X_ref19","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000095"},{"key":"S147106842300011X_ref20","first-page":"1","article-title":"Methods and tools for policy analysis","volume":"6","author":"Jabal","year":"2019","journal-title":"ACM Computing Surveys 51"},{"key":"S147106842300011X_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83397-7_2"},{"key":"S147106842300011X_ref10","doi-asserted-by":"publisher","DOI":"10.1145\/501978.501980"},{"key":"S147106842300011X_ref15","doi-asserted-by":"crossref","unstructured":"Gelfond, M. and Son, T. C. 1997. Reasoning with prioritized defaults. In Third International Workshop on Logic Programming and Knowledge Representation, Third International Workshop. LNCS, vol. 1471. Springer, 164\u2013223.","DOI":"10.1007\/BFb0054795"},{"key":"S147106842300011X_ref4","doi-asserted-by":"crossref","unstructured":"Cabalar, P. , Fandinno, J. and Mu\u00f1iz, B. 2020. A system for explainable answer set programming. In Proceedings 36th International Conference on Logic Programming (Technical Communications). EPTCS, vol. 325, 124\u2013136.","DOI":"10.4204\/EPTCS.325.19"},{"key":"S147106842300011X_ref23","doi-asserted-by":"crossref","unstructured":"Marek, V. W. and Truszczynski, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm - A 25-Year Perspective, K. R. Apt, V. W. Marek, M. Truszczynski and D. S. Warren, Eds. Artificial Intelligence. Springer, 375\u2013398.","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"S147106842300011X_ref24","doi-asserted-by":"crossref","unstructured":"Meyer, J. and Inclezan, D. 2021. APIA: An architecture for policy-aware intentional agents. In Proceedings of the 37th International Conference on Logic Programming (Technical Communications). EPTCS, vol. 345, 84\u201398.","DOI":"10.4204\/EPTCS.345.23"},{"key":"S147106842300011X_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139342124"},{"key":"S147106842300011X_ref25","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.13431"},{"key":"S147106842300011X_ref6","doi-asserted-by":"crossref","unstructured":"Craven, R. , Lobo, J. , Ma, J. , Russo, A. , Lupu, E. and Bandara, A. 2009. Expressive policy analysis with enhanced system dynamicity. In Proceedings of the 4th International Symposium on Information, Computer, and Communications Security. Association for Computing Machinery, New York, NY, USA, 239\u2013250.","DOI":"10.1145\/1533057.1533091"},{"key":"S147106842300011X_ref7","doi-asserted-by":"crossref","unstructured":"Davari, M. and Zulkernine, M. 2021. Policy modeling and anomaly detection in ABAC policies. In Risks and Security of Internet and Systems: 16th International Conference, CRiSIS 2021. Springer-Verlag, Berlin, Heidelberg, 137\u2013152.","DOI":"10.1007\/978-3-031-02067-4_9"},{"key":"S147106842300011X_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000305"},{"key":"S147106842300011X_ref9","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000534"},{"key":"S147106842300011X_ref26","doi-asserted-by":"crossref","unstructured":"Xu, D. , Wang, Z. , Peng, S. and Shen, N. 2016. Automated fault localization of XACML policies. In Proceedings of the 21st ACM on Symposium on Access Control Models and Technologies. SACMAT\u201916. Association for Computing Machinery, New York, NY, USA, 137\u2013147.","DOI":"10.1145\/2914642.2914653"},{"key":"S147106842300011X_ref11","doi-asserted-by":"publisher","DOI":"10.1080\/11663081.2013.798954"},{"key":"S147106842300011X_ref1","doi-asserted-by":"crossref","unstructured":"Alves, S. and Fern\u00e1ndez, M. 2014. A framework for the analysis of access control policies with emergency management. In Ninth Workshop on Logical and Semantic Frameworks, with Applications, LSFA 2014, Braslia, Brazil, 8\u20139 September 2014, M. Ayala-Rinc\u00f3n and I. Mackie, Eds. Electronic Notes in Theoretical Computer Science, vol. 312. Elsevier, 89\u2013105.","DOI":"10.1016\/j.entcs.2015.04.006"},{"key":"S147106842300011X_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068416000363"},{"key":"S147106842300011X_ref22","doi-asserted-by":"crossref","unstructured":"LeBlanc, E. C. , Balduccini, M. and Vennekens, J. 2019. Explaining actual causation via reasoning about actions and change. In Proceedings of the 16th European Conference on Logics in Artificial Intelligence, JELIA. LNCS, vol. 11468. Springer, 231\u2013246.","DOI":"10.1007\/978-3-030-19570-0_15"},{"year":"2019","author":"De Vos","key":"S147106842300011X_ref8"},{"key":"S147106842300011X_ref16","unstructured":"Havur, G. , Neumaier, S. and Pellegrini, T. 2021. DALICC as a service - A scaleable architecture. In Joint Proceedings of the Semantics co-located events: Poster&Demo track and Workshop on Ontology-Driven Conceptual Modelling of Digital Twins co-located with Semantics 2021, Amsterdam and Online, September 6\u20139, 2021, I. Tiddi, M. Maleshkova, T. Pellegrini and V. de Boer, Eds. CEUR-WS.org. URL: https:\/\/ceur-ws.org\/Vol-2941\/paper12.pdf."},{"key":"S147106842300011X_ref3","doi-asserted-by":"crossref","unstructured":"Blount, J. , Gelfond, M. and Balduccini, M. 2015. A theory of intentions for intelligent agents - (Extended Abstract). In Proceedings of the 13th International Conference on Logic Programming and Nonmonotonic Reasoning. LNCS, vol. 9345. Springer, 134\u2013142.","DOI":"10.1007\/978-3-319-23264-5_12"},{"key":"S147106842300011X_ref18","doi-asserted-by":"crossref","unstructured":"Inclezan, D. 2019. RestKB: A library of commonsense knowledge about dining at a restaurant. In Proceedings 35th International Conference on Logic Programming (Technical Communications), ICLP 2019 Technical Communications, Las Cruces, NM, USA, 20\u201325 September 2019. EPTCS, vol. 306, 126\u2013139.","DOI":"10.4204\/EPTCS.306.19"}],"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\/S147106842300011X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T09:38:21Z","timestamp":1709026701000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S147106842300011X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["S147106842300011X"],"URL":"https:\/\/doi.org\/10.1017\/s147106842300011x","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2023,7]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. 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"}]}}