{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T11:00:57Z","timestamp":1794481257797,"version":"4.9.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319098692","type":"print"},{"value":"9783319098708","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09870-8_12","type":"book-chapter","created":{"date-parts":[[2014,7,20]],"date-time":"2014-07-20T21:06:07Z","timestamp":1405890367000},"page":"168-177","source":"Crossref","is-referenced-by-count":5,"title":["The Hardness of Revising Defeasible Preferences"],"prefix":"10.1007","author":[{"given":"Guido","family":"Governatori","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Olivieri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simone","family":"Scannapieco","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matteo","family":"Cristani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"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., Christaller, T., Cremers, A.B. (eds.) KI 1999. LNCS (LNAI), vol.\u00a01701, pp. 101\u2013112. Springer, Heidelberg (1999)"},{"key":"12_CR2","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.\u00a06403, pp. 104\u2013118. Springer, Heidelberg (2010)"},{"key":"12_CR3","unstructured":"Governatori, G., Olivieri, F., Scannapieco, S., Cristani, M.: Revision of defeasible logic preferences. CoRR abs\/1206.5833 (2012)"},{"key":"12_CR4","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.J.: Representation results for defeasible logic. ACM Transactions on Computational Logic\u00a02, 255\u2013287 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"12_CR5","unstructured":"Antoniou, G., Billington, D., Governatori, G., Maher, M.J., Rock, A.: A family of defeasible reasoning logics and its implementation. In: ECAI 2000, pp. 459\u2013463 (2000)"},{"key":"12_CR6","first-page":"703","volume":"6","author":"G. Antoniou","year":"2006","unstructured":"Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: Embedding defeasible logic into logic programming. TPLP\u00a06, 703\u2013735 (2006)","journal-title":"TPLP"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1017\/S1471068401001168","volume":"1","author":"M.J. Maher","year":"2001","unstructured":"Maher, M.J.: Propositional defeasible logic has linear complexity. Theory and Practice of Logic Programming\u00a01, 691\u2013711 (2001)","journal-title":"Theory and Practice of Logic Programming"},{"key":"12_CR8","unstructured":"Mindolin, D., Chomicki, J.: Minimal contraction of preference relations. In: Fox, D., Gomes, C.P. (eds.) AAAI, pp. 492\u2013497. AAAI Press (2008)"},{"issue":"7-8","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1016\/j.artint.2010.11.011","volume":"175","author":"D. Mindolin","year":"2011","unstructured":"Mindolin, D., Chomicki, J.: Contracting preference relations for database applications. Artif. Intell.\u00a0175(7-8), 1092\u20131121 (2011)","journal-title":"Artif. Intell."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Governatori, G., Rotolo, A., Olivieri, F., Scannapieco, S.: Legal contractions: a logical analysis. In: Francesconi, E., Verheij, B. (eds.) ICAIL, pp. 63\u201372. ACM (2013)","DOI":"10.1145\/2514601.2514609"},{"key":"12_CR11","unstructured":"Inoue, K., Sakama, C.: Abducing priorities to derive intended conclusions. In: Dean, T. (ed.) IJCAI, pp. 44\u201349. Morgan Kaufmann (1999)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(91)90069-V","volume":"52","author":"H. Katsuno","year":"1991","unstructured":"Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artificial Intelligence\u00a052, 263\u2013294 (1991)","journal-title":"Artificial Intelligence"},{"key":"12_CR13","unstructured":"Cristani, M.: Many-sorted preference relations. In: Fensel, D., Giunchiglia, F., McGuinness, D.L., Williams, M.A. (eds.) KR, pp. 265\u2013276. Morgan Kaufmann (2002)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1006\/jsco.1994.1037","volume":"18","author":"I. D\u00fcntsch","year":"1994","unstructured":"D\u00fcntsch, I.: A microcomputer based system for small relation algebras. J. Symb. Comput.\u00a018, 83\u201386 (1994)","journal-title":"J. Symb. Comput."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.artint.2004.02.003","volume":"156","author":"M. Cristani","year":"2004","unstructured":"Cristani, M., Hirsch, R.: The complexity of constraint satisfaction problems for small relation algebras. Artif. Intell.\u00a0156, 177\u2013196 (2004)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Rules on the Web. From Theory to Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09870-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T23:22:10Z","timestamp":1548890530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09870-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319098692","9783319098708"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09870-8_12","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-09870-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}