{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:54:32Z","timestamp":1757627672069,"version":"3.44.0"},"publisher-location":"Cham","reference-count":67,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032045867"},{"type":"electronic","value":"9783032045874"}],"license":[{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04587-4_12","type":"book-chapter","created":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T09:29:42Z","timestamp":1756805382000},"page":"187-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["deon-$$\\mathcal {B}$$: A Language for\u00a0Well-Founded Deontic Planning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7535-5605","authenticated-orcid":false,"given":"Davide","family":"Sold\u00e0","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6003-6345","authenticated-orcid":false,"given":"Thomas","family":"Eiter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Abels, D., Jordi, J., Ostrowski, M., Schaub, T., Toletti, A., Wanko, P.: Train scheduling with hybrid ASP. In: Proceedings of the 15th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2019). LNCS, vol. 11481, pp. 3\u201317. Springer (2019)","DOI":"10.1007\/978-3-030-20528-7_1"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"\u00c5gotnes, T., van\u00a0der Hoek, W., Rodr\u00edguez-Aguilar, J.A., Sierra, C., Wooldridge, M.: A temporal logic of normative systems. In: Makinson, D., Malinowski, J., Wansing, H. (eds.) Towards Mathematical Philosophy: Papers from the Studia Logica conference Trends in Logic IV, pp. 69\u2013106. Springer Netherlands, Dordrecht (2009). https:\/\/doi.org\/10.1007\/978-1-4020-9084-4_5","DOI":"10.1007\/978-1-4020-9084-4_5"},{"issue":"2","key":"12_CR3","first-page":"457","volume":"5","author":"N Alechina","year":"2018","unstructured":"Alechina, N., Dastani, M., Logan, B.: Norm specification and verification in multi-agent systems. J. Appl. Logics 5(2), 457 (2018)","journal-title":"J. Appl. Logics"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF00883931","volume":"14","author":"JJ Alferes","year":"1995","unstructured":"Alferes, J.J., Damasio, C.V., Pereira, L.M.: A logic programming system for nonmonotonic reasoning. J. Autom. Reason. 14, 93\u2013147 (1995)","journal-title":"J. Autom. Reason."},{"issue":"1\u20132","key":"12_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1080\/11663081.2013.798996","volume":"23","author":"JJ Alferes","year":"2013","unstructured":"Alferes, J.J., Gon\u00e7alves, R., Leite, J.: Equivalence of defeasible normative systems. J. Appl. Non-Classical Logics 23(1\u20132), 25\u201348 (2013)","journal-title":"J. Appl. Non-Classical Logics"},{"key":"12_CR6","unstructured":"Alferes, J.J.A.: Semantics of logic programs with explicit negation. Universidade NOVA de Lisboa (Portugal) (1993)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89\u2013148. Elsevier (1988)","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"issue":"1\u20132","key":"12_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0004-3702(00)00043-6","volume":"122","author":"C Baral","year":"2000","unstructured":"Baral, C., Kreinovich, V., Trejo, R.: Computational complexity of planning and approximate planning in the presence of incompleteness. Artif. Intell. 122(1\u20132), 241\u2013267 (2000). https:\/\/doi.org\/10.1016\/S0004-3702(00)00043-6","journal-title":"Artif. Intell."},{"issue":"4\u20135","key":"12_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.artint.2006.01.004","volume":"170","author":"P Bertoli","year":"2006","unstructured":"Bertoli, P., Cimatti, A., Roveri, M., Traverso, P.: Strong planning under partial observability. Artif. Intell. 170(4\u20135), 337\u2013384 (2006)","journal-title":"Artif. Intell."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Bozzano, M., et\u00a0al.: ROBDT: AI-enhanced digital twin for space exploration robotic assets. In: International Conference on Applied Intelligence and Informatics, pp. 183\u2013198. Springer (2022)","DOI":"10.1007\/978-3-031-25755-1_12"},{"issue":"12","key":"12_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Broersen, J., et al.: Deontic logic. Agreement Technol., 171\u2013179 (2013)","DOI":"10.1007\/978-94-007-5583-3_10"},{"issue":"1\u20132","key":"12_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T Bylander","year":"1994","unstructured":"Bylander, T.: The computational complexity of propositional strips planning. Artif. Intell. 69(1\u20132), 165\u2013204 (1994)","journal-title":"Artif. Intell."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Cabalar, P., Ciabattoni, A., van\u00a0der Torre, L.: Deontic equilibrium logic with explicit negation. In: JELIA 2023. LNCS, vol. 14281, pp. 498\u2013514. Springer (2023)","DOI":"10.1007\/978-3-031-43619-2_34"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Carmo, J., Jones, A.J.: Deontic logic and contrary-to-duties. In: Handbook of Philosophical Logic: Volume 8, pp. 265\u2013343. Springer (2002)","DOI":"10.1007\/978-94-010-0387-2_4"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Cerexhe, T.J., Gebser, M., Thielscher, M.: Online agent logic programming with oclingo. In: Pham, D.N., Park, S. (eds.) PRICAI 2014. Lecture Notes in Computer Science, vol.\u00a08862, pp. 945\u2013957. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-13560-1_82","DOI":"10.1007\/978-3-319-13560-1_82"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","volume":"2","author":"AK Chandra","year":"1985","unstructured":"Chandra, A.K., Harel, D.: Horn clause queries and generalizations. J. Logic Program. 2(1), 1\u201315 (1985)","journal-title":"J. Logic Program."},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1093\/analys\/24.2.33","volume":"24","author":"R Chisholm","year":"1963","unstructured":"Chisholm, R.: Contrary-to-duty imperatives and deontic logic. Analysis 24(2), 33\u201336 (1963)","journal-title":"Analysis"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1613\/jair.774","volume":"13","author":"A Cimatti","year":"2000","unstructured":"Cimatti, A., Roveri, M.: Conformant planning via symbolic model checking. J. Artif. Intell. Res. 13, 305\u2013338 (2000)","journal-title":"J. Artif. Intell. Res."},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Comploi-Taupe, R., Francescutto, G., Schenner, G.: Applying incremental answer set solving to product configuration. In: Proceedings of the 26th ACM International Systems and Software Product Line Conference (SPLC 2022), pp. 150\u2013155. ACM (2022). https:\/\/doi.org\/10.1145\/3503229.3547069","DOI":"10.1145\/3503229.3547069"},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. (CSUR) 33(3), 374\u2013425 (2001)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: Planning under incomplete knowledge. In: International Conference on Computational Logic, pp. 807\u2013821. Springer (2000)","DOI":"10.1007\/3-540-44957-4_54"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: A logic programming approach to knowledge-state planning: semantics and complexity. ACM Trans. Comput. Log. 5(2), 206\u2013263 (2004). https:\/\/doi.org\/10.1145\/976706.976708","DOI":"10.1145\/976706.976708"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: propositional case. Ann. Math. Artif. Intell. 15, 289\u2013323 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Eiter, T., Ianni, G., Krennwallner, T.: Answer set programming: a primer. Springer (2009)","DOI":"10.1007\/978-3-642-03754-2_2"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Eiter, T., Leone, N., Sacc\u00e0, D.: On the partial semantics for disjunctive deductive databases. Ann. Math. Artif. Intell. 19(1-2), 59\u201396 (1997). https:\/\/doi.org\/10.1023\/A:1018947420290","DOI":"10.1023\/A:1018947420290"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"Eiter, T., Sold\u00e0, D.: Computational aspects of progression for temporal equilibrium logic. In: Larson, K. (ed.) Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24, pp. 3342\u20133350. International Joint Conferences on Artificial Intelligence Organization (2024). https:\/\/doi.org\/10.24963\/ijcai.2024\/370. main Track","DOI":"10.24963\/ijcai.2024\/370"},{"issue":"3","key":"12_CR28","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v37i3.2678","volume":"37","author":"E Erdem","year":"2016","unstructured":"Erdem, E., Gelfond, M., Leone, N.: Applications of answer set programming. AI Mag. 37(3), 53\u201368 (2016). https:\/\/doi.org\/10.1609\/aimag.v37i3.2678","journal-title":"AI Mag."},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s13218-018-0544-x","volume":"32","author":"E Erdem","year":"2018","unstructured":"Erdem, E., Patoglu, V.: Applications of asp in robotics. KI-K\u00fcnstliche Intelligenz 32(2), 143\u2013149 (2018)","journal-title":"KI-K\u00fcnstliche Intelligenz"},{"key":"12_CR30","doi-asserted-by":"publisher","unstructured":"Falkner, A., Friedrich, G., Schekotihin, K., Taupe, R., Teppan, E.C.: Industrial applications of answer set programming. KI - K\u00fcnstliche Intelligenz 32(2), 165\u2013176 (2018). https:\/\/doi.org\/10.1007\/s13218-018-0548-6","DOI":"10.1007\/s13218-018-0548-6"},{"key":"12_CR31","unstructured":"Gabbay, D., et\u00a0al.: Handbook of deontic logic and normative systems. College Publications (2021)"},{"key":"12_CR32","unstructured":"Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Warren, D.H.D., Szeredi, P. (eds.) Logic Programming, Proceedings of the Seventh International Conference, Jerusalem, Israel, pp. 579\u2013597. MIT Press (1990)"},{"key":"12_CR33","unstructured":"Gelfond, M., Lifschitz, V.: Action languages. Link\u00f6ping University Electronic Press (1998)"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"Giordano, L., Martelli, A., Dupr\u00e9, D.T.: Temporal deontic action logic for the verification of compliance to norms in ASP. In: ICAIL 2013, pp. 53\u201362. ACM (2013)","DOI":"10.1145\/2514601.2514608"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Governatori, G.: Law, logic and business processes. In: 2010 Third International Workshop on Requirements Engineering and Law, pp. 1\u201310. IEEE (2010)","DOI":"10.1109\/RELAW.2010.5625356"},{"key":"12_CR36","doi-asserted-by":"publisher","unstructured":"Governatori, G.: Weak permission is not well-founded, grounded and stable. CoRR abs\/2411.10624 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2411.10624","DOI":"10.48550\/ARXIV.2411.10624"},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Governatori, G., Hulstijn, J., Riveret, R., Rotolo, A.: Characterising deadlines in temporal modal defeasible logic. In: Advances in Artificial Intelligence, pp. 486\u2013496. Springer (2007)","DOI":"10.1007\/978-3-540-76928-6_50"},{"issue":"6","key":"12_CR38","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s10992-013-9295-1","volume":"42","author":"G Governatori","year":"2013","unstructured":"Governatori, G., Olivieri, F., Rotolo, A., Scannapieco, S.: Computing strong and weak permissions in defeasible logic. J. Phil. Logic 42(6), 799\u2013829 (2013)","journal-title":"J. Phil. Logic"},{"key":"12_CR39","doi-asserted-by":"crossref","unstructured":"Hatschka, C., Ciabattoni, A., Eiter, T.: Deontic paradoxes in ASP with weak constraints. In: Proceedings of ICLP 2023. EPTCS, vol.\u00a0385, pp. 367\u2013380 (2023)","DOI":"10.4204\/EPTCS.385.39"},{"key":"12_CR40","unstructured":"Horty, J.: Deontic Logic and Agency. OUP (2001)"},{"key":"12_CR41","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF01417957","volume":"23","author":"JF Horty","year":"1994","unstructured":"Horty, J.F.: Moral dilemmas and nonmonotonic logic. J. Philos. Log. 23, 35\u201365 (1994)","journal-title":"J. Philos. Log."},{"key":"12_CR42","unstructured":"Joyce, J.: Policy-adaptable methods for resolving normative conflicts through argumentation and graph colouring. arXiv preprint: arXiv:2501.11799 (2025)"},{"key":"12_CR43","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Answer Set Programming, vol. 3. Springer Cham (2019)","DOI":"10.1007\/978-3-030-24658-7"},{"key":"12_CR44","doi-asserted-by":"crossref","unstructured":"McCarthy, J., Hayes, P.J.: Some philosophical problems from the standpoint of artificial intelligence. In: Readings in artificial intelligence, pp. 431\u2013450. Elsevier (1981)","DOI":"10.1016\/B978-0-934613-03-3.50033-7"},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"Nute, D.: Defeasible Deontic Logic, vol.\u00a0263. Springer Science & Business Media (1997)","DOI":"10.1007\/978-94-015-8851-5"},{"key":"12_CR46","doi-asserted-by":"crossref","unstructured":"Peot, M.A., Smith, D.E.: Conditional nonlinear planning. In: Artificial Intelligence Planning Systems, pp. 189\u2013197. Elsevier (1992)","DOI":"10.1016\/B978-0-08-049944-4.50027-6"},{"key":"12_CR47","unstructured":"Pereira, L.M., Alferes, J.J.: Well founded semantics for logic programs with explicit negation. In: Proceedings of the 10th European Conference on Artificial Intelligence, ECAI \u201992, pp. 102\u2013106. John Wiley & Sons, Inc., USA (1992)"},{"key":"12_CR48","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF00370671","volume":"57","author":"H Prakken","year":"1996","unstructured":"Prakken, H., Sergot, M.: Contrary-to-duty obligations. Stud. Logica. 57, 91\u2013115 (1996)","journal-title":"Stud. Logica."},{"key":"12_CR49","doi-asserted-by":"crossref","unstructured":"Przymusinski, T.C.: On the declarative semantics of deductive databases and logic programs. In: Foundations of Deductive Databases and Logic Programming, pp. 193\u2013216. Elsevier (1988)","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"12_CR50","unstructured":"Rintanen, J.: Complexity of planning with partial observability. In: ICAPS, pp. 345\u2013354. AAAI (2004)"},{"key":"12_CR51","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10849-019-09309-z","volume":"29","author":"L Robaldo","year":"2020","unstructured":"Robaldo, L., Bartolini, C., Palmirani, M., Rossi, A., Martoni, M., Lenzini, G.: Formalizing GDPR provisions in reified I\/O logic: the DAPRECO knowledge base. J. Logic Lang. Inform. 29, 401\u2013449 (2020)","journal-title":"J. Logic Lang. Inform."},{"issue":"1","key":"12_CR52","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1086\/286823","volume":"11","author":"A Ross","year":"1944","unstructured":"Ross, A.: Imperatives and logic. Philos. Sci. 11(1), 30\u201346 (1944)","journal-title":"Philos. Sci."},{"key":"12_CR53","doi-asserted-by":"crossref","unstructured":"Satoh, K.: PROLEG: practical legal reasoning system. In: Prolog: The Next 50 Years, pp. 277\u2013283. Springer (2023)","DOI":"10.1007\/978-3-031-35254-6_23"},{"key":"12_CR54","unstructured":"Sentencing Council: Speeding (revised 2017) (2017). https:\/\/www.sentencingcouncil.org.uk\/offences\/magistrates-court\/item\/speeding-revised-2017. Accessed 05 Mar 2025"},{"key":"12_CR55","unstructured":"Smith, D.E., Weld, D.S.: Conformant Graphplan. In: AAAI\/IAAI, pp. 889\u2013896 (1998)"},{"key":"12_CR56","doi-asserted-by":"publisher","unstructured":"Sold\u00e0, D., Fabiano, F., Dovier, A.: ECHO: a hierarchical combination of classical and multi-agent epistemic planning problems. J. Log. Comput. 33(8), 1804\u20131831 (2023). https:\/\/doi.org\/10.1093\/LOGCOM\/EXAD036","DOI":"10.1093\/LOGCOM\/EXAD036"},{"key":"12_CR57","doi-asserted-by":"crossref","unstructured":"Sold\u00e0, D., Lopez-Miguel, I.D., Bartocci, E., Eiter, T.: Progression for monitoring in temporal ASP. In: ECAI 2023, vol.\u00a0372, pp. 2170\u20132177. IOS Press (2023)","DOI":"10.3233\/FAIA230513"},{"key":"12_CR58","unstructured":"Sold\u00e0, D., Cabalar, P., Ciabattoni, A., Neufeld, E.: Tackling temporal deontic challenges with equilibrium logic. In: AAMAS (2024)"},{"key":"12_CR59","doi-asserted-by":"crossref","unstructured":"Thomason, R.: Deontic logic as founded on tense logic. In: New Studies in Deontic Logic: Norms, Actions, and the Foundation of Ethics. Reidel Publishing Company (1981)","DOI":"10.1007\/978-94-009-8484-4_7"},{"key":"12_CR60","unstructured":"van\u00a0der Torre, L.W., Tan, Y.H.: An update semantics for prima facie obligations. In: ECAI, pp. 38\u201342 (1998)"},{"issue":"1","key":"12_CR61","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1017\/S1471068422000072","volume":"23","author":"SC Tran","year":"2023","unstructured":"Tran, S.C., Pontelli, E., Balduccini, M., Schaub, T.: Answer set planning: a survey. Theory Pract. Logic Program. 23(1), 226\u2013298 (2023)","journal-title":"Theory Pract. Logic Program."},{"key":"12_CR62","doi-asserted-by":"crossref","unstructured":"Turner, H.: Polynomial-length planning spans the polynomial hierarchy. In: Proc. of JELIA, pp. 111\u2013124. Springer (2002)","DOI":"10.1007\/3-540-45757-7_10"},{"issue":"1","key":"12_CR63","doi-asserted-by":"publisher","first-page":"5","DOI":"10.2307\/2024762","volume":"70","author":"BC Van Fraassen","year":"1973","unstructured":"Van Fraassen, B.C.: Values and the heart\u2019s command. J. Philos. 70(1), 5\u201319 (1973)","journal-title":"J. Philos."},{"key":"12_CR64","doi-asserted-by":"crossref","unstructured":"Van\u00a0Gelder, A., Ross, K., Schlipf, J.S.: Unfounded sets and well-founded semantics for general logic programs. In: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pp. 221\u2013230 (1988)","DOI":"10.1145\/308386.308444"},{"issue":"3","key":"12_CR65","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1145\/116825.116838","volume":"38","author":"A Van Gelder","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM (JACM) 38(3), 619\u2013649 (1991)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"12_CR66","first-page":"136","volume":"4","author":"GH von Wright","year":"1967","unstructured":"von Wright, G.H.: Deontic logics. Am. Philos. Q. 4(2), 136\u2013143 (1967)","journal-title":"Am. Philos. Q."},{"key":"12_CR67","doi-asserted-by":"crossref","unstructured":"Yli-Jyr\u00e4, A., Rankooh, M.F., Janhunen, T.: Pruning redundancy in answer set optimization applied to preventive maintenance scheduling. In: Proceedings of the 25th International Symposium on Practical Aspects of Declarative Languages (PADL 2023), pp. 279\u2013294. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-24841-2_18"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04587-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:09:13Z","timestamp":1757477353000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04587-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,29]]},"ISBN":["9783032045867","9783032045874"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04587-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,29]]},"assertion":[{"value":"29 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kutaisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.jelia.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}