{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T15:33:22Z","timestamp":1757777602231},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642333521"},{"type":"electronic","value":"9783642333538"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33353-8_7","type":"book-chapter","created":{"date-parts":[[2012,9,6]],"date-time":"2012-09-06T10:18:53Z","timestamp":1346926733000},"page":"80-93","source":"Crossref","is-referenced-by-count":9,"title":["Inconsistency Management for Traffic Regulations: Formalization and Complexity Results"],"prefix":"10.1007","author":[{"given":"Harald","family":"Beck","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Eiter","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Krennwallner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"7_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.J.: Representation results for defeasible logic. ACM Trans. Comput. Logic\u00a02(2), 255\u2013287 (2001)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"12","key":"7_CR2","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\u00a054(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"issue":"1-2","key":"7_CR3","first-page":"42","volume":"3","author":"L. Console","year":"2006","unstructured":"Console, L., Torasso, P.: Automated diagnosis. Intelligenza Artificiale\u00a03(1-2), 42\u201348 (2006)","journal-title":"Intelligenza Artificiale"},{"issue":"3","key":"7_CR4","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.\u00a033(3), 374\u2013425 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"2-4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10472-008-9086-5","volume":"51","author":"T. Eiter","year":"2007","unstructured":"Eiter, T., Faber, W., Fink, M., Woltran, S.: Complexity Results for Answer Set Programming with Bounded Predicate Arities. Ann. Math. Artif. Intell.\u00a051(2-4), 123\u2013165 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1-2","key":"7_CR6","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. Theoretical Computer Science\u00a0189(1-2), 129\u2013177 (1997)","journal-title":"Theoretical Computer Science"},{"key":"7_CR7","unstructured":"Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A uniform integration of higher-order reasoning and external evaluations in answer set programming. In: IJCAI, pp. 90\u201396 (2005)"},{"issue":"2","key":"7_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M. Gebser","year":"2011","unstructured":"Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.T.: Potassco: The Potsdam answer set solving collection. AI Commun.\u00a024(2), 107\u2013124 (2011)","journal-title":"AI Commun."},{"issue":"3-4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. Next Generat. Comput.\u00a09(3-4), 365\u2013386 (1991)","journal-title":"Next Generat. Comput."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"de Kleer, J., Kurien, J.: Fundamentals of model-based diagnosis. In: IFAC Symposium SAFEPROCESS 2003, pp. 25\u201336. Elsevier (2003)","DOI":"10.1016\/S1474-6670(17)36467-4"},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM TOCL\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM TOCL"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1017\/S0269888997002026","volume":"12","author":"P. Lucas","year":"1997","unstructured":"Lucas, P.: Symbolic diagnosis and its formalisation. Knowl. Eng. Rev.\u00a012, 109\u2013146 (1997)","journal-title":"Knowl. Eng. Rev."},{"issue":"6","key":"7_CR13","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 Pract. Log. Program.\u00a01(6), 691\u2013711 (2001)","journal-title":"Theory Pract. Log. Program."},{"key":"7_CR14","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)"},{"key":"7_CR15","unstructured":"Poole, D.: Normality and faults in logic-based diagnosis. In: IJCAI, pp. 1304\u20131310 (1989)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01530736","volume":"11","author":"D. Poole","year":"1994","unstructured":"Poole, D.: Representing diagnosis knowledge. Ann. Math. Artif. Intell.\u00a011, 33\u201350 (1994)","journal-title":"Ann. Math. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33353-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T07:57:08Z","timestamp":1594627028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33353-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642333521","9783642333538"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33353-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}