{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T15:40:51Z","timestamp":1768405251680,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031157066","type":"print"},{"value":"9783031157073","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15707-3_19","type":"book-chapter","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T11:02:47Z","timestamp":1661511767000},"page":"245-258","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Inference to\u00a0the\u00a0Stable Explanations"],"prefix":"10.1007","author":[{"given":"Guido","family":"Governatori","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Olivieri","sequence":"additional","affiliation":[]},{"given":"Antonino","family":"Rotolo","sequence":"additional","affiliation":[]},{"given":"Matteo","family":"Cristani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/371316.371517","volume":"2","author":"G Antoniou","year":"2001","unstructured":"Antoniou, G., Billington, D., Governatori, G., Maher, M.: Representation results for defeasible logic. ACM Trans. Comput. Log. 2(2), 255\u2013287 (2001). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/371316.371517","journal-title":"ACM Trans. Comput. Log."},{"issue":"4","key":"19_CR2","first-page":"237","volume":"12","author":"J Augusto","year":"1999","unstructured":"Augusto, J., Simari, G.: Temporal argumentative system. AI Commun. 12(4), 237\u2013257 (1999)","journal-title":"AI Commun."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-58507-9_8","volume":"14","author":"D Batens","year":"2017","unstructured":"Batens, D.: Abduction logics: Illustrating pitfalls of defeasible methods. Logic Argumentation Reasoning 14, 169\u2013193 (2017). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-58507-9_8","journal-title":"Logic Argumentation Reasoning"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-48238-5_8","volume-title":"KI-99: Advances in Artificial Intelligence","author":"D Billington","year":"1999","unstructured":"Billington, D., Antoniou, G., Governatori, G., Maher, M.: Revising nonmonotonic theories: the case of defeasible logic. In: Burgard, W., Cremers, A.B., Cristaller, T. (eds.) KI 1999. LNCS (LNAI), vol. 1701, pp. 101\u2013112. Springer, Heidelberg (1999). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/3-540-48238-5_8"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Brewka, G., Thimm, M., Ulbricht, M.: Strong inconsistency. Artif. Intell. 267, 78\u2013117 (2019). https:\/\/2.zoppoz.workers.dev:443\/http\/dblp.uni-trier.de\/db\/journals\/ai\/ai267.html#BrewkaTU19","DOI":"10.1016\/j.artint.2018.11.002"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-22102-7_6","volume-title":"Description Logic, Theory Combination, and All That","author":"G Brewka","year":"2019","unstructured":"Brewka, G., Ulbricht, M.: Strong explanations for nonmonotonic reasoning. In: Lutz, C., Sattler, U., Tinelli, C., Turhan, A.-Y., Wolter, F. (eds.) Description Logic, Theory Combination, and All That. LNCS, vol. 11560, pp. 135\u2013146. Springer, Cham (2019). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-22102-7_6"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0004-3702(91)90005-5","volume":"49","author":"T Bylander","year":"1991","unstructured":"Bylander, T., Allemang, D., Tanner, M.C., Josephson, J.R.: The computational complexity of abduction. Artif. Intell. 49(1), 25\u201360 (1991). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/0004-3702(91)90005-5","journal-title":"Artif. Intell."},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.jal.2004.07.003","volume":"2","author":"C Delrieux","year":"2004","unstructured":"Delrieux, C.: Abductive inference in defeasible reasoning: A model for research programmes. J. Appl. Log. 2(4), 409\u2013437 (2004). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jal.2004.07.003","journal-title":"J. Appl. Log."},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/200836.200838","volume":"42","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: The complexity of logic-based abduction. J. ACM (JACM) 42(1), 3\u201342 (1995). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/200836.200838","journal-title":"J. ACM (JACM)"},{"issue":"1\u20132","key":"19_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/s0304-3975(96)00179-x","volume":"189","author":"T Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Leone, N.: Abduction from logic programs: semantics and complexity. Theoret. Comput. Sci. 189(1\u20132), 129\u2013177 (1997). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/s0304-3975(96)00179-x","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"19_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/s0004-3702(96)00040-9","volume":"90","author":"T Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Leone, N.: Semantics and complexity of abduction from default theories. Artif. Intell. 90(1\u20132), 177\u2013223 (1997). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/s0004-3702(96)00040-9","journal-title":"Artif. Intell."},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ijar.2018.10.020","volume":"104","author":"G Governatori","year":"2019","unstructured":"Governatori, G., Olivieri, F., Cristani, M., Scannapieco, S.: Revision of defeasible preferences. Int. J. Approximate Reasoning 104, 205\u2013230 (2019). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ijar.2018.10.020","journal-title":"Int. J. Approximate Reasoning"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-16289-3_10","volume-title":"Semantic Web Rules","author":"G Governatori","year":"2010","unstructured":"Governatori, G., Olivieri, F., Scannapieco, S., Cristani, M.: Superiority based revision of defeasible theories. In: Dean, M., Hall, J., Rotolo, A., Tabet, S. (eds.) RuleML 2010. LNCS, vol. 6403, pp. 104\u2013118. Springer, Heidelberg (2010). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-642-16289-3_10"},{"issue":"5","key":"19_CR14","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1093\/logcom\/14.5.675","volume":"14","author":"G Governatori","year":"2004","unstructured":"Governatori, G., Maher, M.J., Billington, D., Antoniou, G.: Argumentation semantics for defeasible logics. J. Log. Comput. 14(5), 675\u2013702 (2004)","journal-title":"J. Log. Comput."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Governatori, G., Olivieri, F., Cristani, M., Scannapieco, S.: Revision of defeasible preferences. Int. J. Approx. Reason. 104, 205\u2013230 (2019). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ijar.2018.10.020","DOI":"10.1016\/j.ijar.2018.10.020"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1093\/jigpal\/jzp006","volume":"17","author":"G Governatori","year":"2009","unstructured":"Governatori, G., Padmanabhan, V., Rotolo, A., Sattar, A.: A defeasible logic for modelling policy-based intentions and motivational attitudes. Log. J. IGPL 17(3), 227\u2013265 (2009). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1093\/jigpal\/jzp006","journal-title":"Log. J. IGPL"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"88","DOI":"10.2307\/2183532","volume":"74","author":"GH Harman","year":"1965","unstructured":"Harman, G.H.: The inference to the best explanation. Philos. Rev. 74(1), 88\u201395 (1965). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.2307\/2183532","journal-title":"Philos. Rev."},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/jigpal\/jzq053","volume":"20","author":"H Lycke","year":"2012","unstructured":"Lycke, H.: A formal explication of the search for explanations: the adaptive logics approach to abductive reasoning. Logic J. IGPL 20(2), 497\u2013516 (2012). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1093\/jigpal\/jzq053","journal-title":"Logic J. IGPL"},{"issue":"6","key":"19_CR19","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1017\/S1471068401001168","volume":"1","author":"MJ Maher","year":"2001","unstructured":"Maher, M.J.: Propositional defeasible logic has linear complexity. Theory Pract. Logic Program. 1(6), 691\u2013711 (2001)","journal-title":"Theory Pract. Logic Program."},{"key":"19_CR20","unstructured":"Nute, D.: Defeasible reasoning. In: Proceedings of the Hawaii International Conference on System Science, vol. 3, pp. 470\u2013477 (1987)"},{"issue":"3","key":"19_CR21","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1093\/logcom\/exu053","volume":"25","author":"A Pfandler","year":"2014","unstructured":"Pfandler, A., Pichler, R., Woltran, S.: The complexity of handling minimal solutions in logic-based abduction. J. Log. Comput. 25(3), 805\u2013825 (2014). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1093\/logcom\/exu053","journal-title":"J. Log. Comput."},{"issue":"3","key":"19_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0004-3702(88)90085-9","volume":"36","author":"Y Shoham","year":"1988","unstructured":"Shoham, Y.: Chronological ignorance: Experiments in nonmonotonic temporal reasoning. Artif. Intell. 36(3), 279\u2013331 (1988). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/0004-3702(88)90085-9","journal-title":"Artif. Intell."},{"issue":"7","key":"19_CR23","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1093\/logcom\/exw028","volume":"27","author":"M Snaith","year":"2017","unstructured":"Snaith, M., Reed, C.: Argument revision. J. Log. Comput. 27(7), 2089\u20132134 (2017). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1093\/logcom\/exw028","journal-title":"J. Log. Comput."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15707-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T21:33:04Z","timestamp":1669411984000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-031-15707-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157066","9783031157073"],"references-count":23,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-031-15707-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Genoa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/lpnmr2022.dibris.unige.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}