{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:49:42Z","timestamp":1743151782826,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030210762"},{"type":"electronic","value":"9783030210779"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-21077-9_32","type":"book-chapter","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T23:14:41Z","timestamp":1560899681000},"page":"347-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Inference Algorithm with Falsifying Patterns for Belief Revision"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8862-064X","authenticated-orcid":false,"given":"P.","family":"Bello","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7948-8253","authenticated-orcid":false,"given":"G.","family":"De Ita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,18]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.artint.2014.07.011","volume":"266","author":"A Belov","year":"2014","unstructured":"Belov, A., Janota, M., Lynce, I., Marques-Silva, J.: Algorithms for computing minimal equivalent subformulas. Artif. Intell. 266, 309\u2013326 (2014)","journal-title":"Artif. Intell."},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3166\/jancl.11.11-34","volume":"11","author":"A Darwiche","year":"2001","unstructured":"Darwiche, A.: On tractable counting of theory models and its application to truth maintenance and belief revision. Appl. NonClassical Logics 11, 11\u201334 (2001)","journal-title":"Appl. NonClassical Logics"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2499937.2499945","volume":"14","author":"A Herzig","year":"2013","unstructured":"Herzig, A., Lang, J., Marquis, P.: Propositional update operators based on formula\/literal dependence. ACM Trans. Comput. Logic 14, 1\u201331 (2013)","journal-title":"ACM Trans. Comput. Logic"},{"key":"32_CR4","unstructured":"Selman, B.: Tractable default reasoning. Ph.D. dissertation, Department of Computer Science University of Toronto (1990)"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"510","DOI":"10.2307\/2274239","volume":"50","author":"C Alchourr\u00f3n","year":"1985","unstructured":"Alchourr\u00f3n, C., G\u00e4rdenfors, P., Makinson, D.: On the logic of theory change: partialmeet contraction and revision functions. J. Symbolic Logic 50, 510\u2013530 (1985)","journal-title":"J. Symbolic Logic"},{"key":"32_CR6","unstructured":"Pons, C., Rosenfeld, R., Smith, C.: \u0141\u00f3gica para inform\u00e1tica, Buenos Aires, Argentina: Universidad Nacional de La Plata, Ed. Universidad de La Plata (2017)"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s11704-013-3089-z","volume":"7","author":"D Jiang","year":"2013","unstructured":"Jiang, D., Li, W., Lou, J., Lou, Y., Lia, Z.: A decomposition based algorithm for maximal contractions. J. Front. Comput. Sci. 7, 801\u2013811 (2013)","journal-title":"J. Front. Comput. Sci."},{"key":"32_CR8","first-page":"133","volume":"5","author":"E Cresto","year":"2002","unstructured":"Cresto, E.: Revis\u00f3n de creencias y racionalidad. Cuadernos del CIMBAGE 5, 133\u2013156 (2002)","journal-title":"Cuadernos del CIMBAGE"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10849-016-9244-9","volume":"25","author":"G Boella","year":"2016","unstructured":"Boella, G., Pigozzi, G., Van der Torre, L.: AGM contraction and revision of rules. J. Logic Lang. Inf. 25, 273\u2013297 (2016)","journal-title":"J. Logic Lang. Inf."},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"3155","DOI":"10.3233\/JIFS-169499","volume":"34","author":"G De Ita","year":"2018","unstructured":"De Ita, G., Marcial, R., Bello, P., Contreras, M.: Belief revisions between conjunctive normal forms. J. Intell. Fuzzy Syst. 34, 3155\u20133164 (2018)","journal-title":"J. Intell. Fuzzy Syst."},{"key":"32_CR11","unstructured":"Katsuno, H., Mendelzon, A.: On the difference between updating a knowledge base and revising it. In: KR 1991, Cambridge, MA, USA, pp. 387\u2013394 (1991)"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1613\/jair.2539","volume":"32","author":"J Delgrande","year":"2008","unstructured":"Delgrande, J., Jin, Y., Pelletier, F.J.: Compositional belief update. J. Artif. Intell. Res. 32, 757\u2013791 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.artint.2017.12.002","volume":"256","author":"M Aiguier","year":"2018","unstructured":"Aiguier, M., Atif, J., Bloch, I., Hudelot, C.: Belief revision, minimal change and relaxation: a general framework based on satisfaction systems, and applications to description logics. Artif. Intell. 256, 160\u2013180 (2018)","journal-title":"Artif. Intell."},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1006\/inco.2001.3043","volume":"176","author":"M Cadoli","year":"2002","unstructured":"Cadoli, M., Donini, F.M., Liberatore, P., Schaerf, M.: Preprocessing of intractable problems. Inf. Comput. 176, 89\u2013120 (2002)","journal-title":"Inf. Comput."},{"key":"32_CR15","first-page":"23","volume":"4","author":"MG R\u00faa","year":"2008","unstructured":"R\u00faa, M.G., Sierra, A.M.: Algunas l\u00f3gicas modales asociadas al razonamiento de agentes inteligentes. Ingenier\u00eda y Ciencia 4, 23\u201345 (2008)","journal-title":"Ingenier\u00eda y Ciencia"},{"key":"32_CR16","doi-asserted-by":"crossref","first-page":"381","DOI":"10.3233\/FI-2015-1163","volume":"136","author":"M Korpusik","year":"2015","unstructured":"Korpusik, M., Lukaszewicz, W., Madali\u0144ska-Bugaj, E.: Consistency-based revision of structured belief bases. Fundamenta Informaticae 136, 381\u2013404 (2015)","journal-title":"Fundamenta Informaticae"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1613\/jair.5541","volume":"61","author":"N Creignou","year":"2018","unstructured":"Creignou, N., Ktari, R., Papini, O.: Belief update within propositional fragments. J. Artif. Intell. Res. 61, 807\u2013834 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(91)90315-S","volume":"81","author":"O Doubois","year":"1991","unstructured":"Doubois, O.: Counting the number of solutions for instances of satisfiability. Theor. Comput. Sci. 81, 49\u201364 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-62222-5_51","volume-title":"Database Theory \u2014 ICDT 97","author":"P Liberatore","year":"1997","unstructured":"Liberatore, P.: The complexity of iterated belief revision. In: Afrati, F., Kolaitis, P. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 276\u2013290. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62222-5_51"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1613\/jair.4608","volume":"52","author":"P Liberatore","year":"2015","unstructured":"Liberatore, P.: Revision by history. J. Artif. Intell. Res. 52, 287\u2013329 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.artint.2015.08.007","volume":"229","author":"P Peppasa","year":"2015","unstructured":"Peppasa, P., Willians, M.A., Choprac, S., Foo, N.: Relevance in belief revision. Artif. Intell. 229, 126\u2013138 (2015)","journal-title":"Artif. Intell."},{"key":"32_CR22","doi-asserted-by":"publisher","first-page":"3199","DOI":"10.3233\/JIFS-169503","volume":"34","author":"P Pozos-Parra","year":"2018","unstructured":"Pozos-Parra, P., Ch\u00e1vez-Bosquez, O., McAreavey, K.: A belief merging tool for consensus support. J. Intell. Fuzzy Syst. 34, 3199\u20133210 (2018)","journal-title":"J. Intell. Fuzzy Syst."},{"key":"32_CR23","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1613\/jair.5521","volume":"61","author":"R Booth","year":"2018","unstructured":"Booth, R., Hunter, A.: Trust as a precursor to belief revision. J. Artif. Intell. Res. 61, 699\u2013722 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"32_CR24","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(96)00006-9","volume":"87","author":"R Khardon","year":"1996","unstructured":"Khardon, R., Roth, D.: Reasoning with models. Artif. Intell. 87, 187\u2013213 (1996)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21077-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:05:05Z","timestamp":1687133105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21077-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030210762","9783030210779"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21077-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MCPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican Conference on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Quer\u00e9taro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mcpr22019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mcpr.org.mx","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":"86","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":"40","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":"0","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":"47% - 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":"2.82","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.39","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}