{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:28:13Z","timestamp":1743107293108,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030867713"},{"type":"electronic","value":"9783030867720"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86772-0_47","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T11:05:54Z","timestamp":1632222354000},"page":"657-671","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Logic and Computation for Popper\u2019s Conditional Probabilities"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1608-474X","authenticated-orcid":false,"given":"Shota","family":"Motoura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,19]]},"reference":[{"issue":"1\u20134","key":"47_CR1","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1080\/00201746508601430","volume":"8","author":"E Adams","year":"1965","unstructured":"Adams, E.: The logic of conditionals. Inquiry 8(1\u20134), 166\u2013197 (1965). https:\/\/doi.org\/10.1080\/00201746508601430","journal-title":"Inquiry"},{"key":"47_CR2","doi-asserted-by":"publisher","unstructured":"Adams, E.W.: Probability and the logic of conditionals. In: Hintikka, J., Suppes, P. (eds.) Aspects of Inductive Logic, Studies in Logic and the Foundations of Mathematics, vol. 43, pp. 265\u2013316. Elsevier (1966). https:\/\/doi.org\/10.1016\/S0049-237X(08)71673-2, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0049237X08716732","DOI":"10.1016\/S0049-237X(08)71673-2"},{"key":"47_CR3","doi-asserted-by":"publisher","unstructured":"Adams, E.W.: The Logic of Conditionals: An Application of Probability to Deductive Logic, Synthese Library, vol. 86. Springer, Netherlands (1975). https:\/\/doi.org\/10.1007\/978-94-015-7622-2","DOI":"10.1007\/978-94-015-7622-2"},{"key":"47_CR4","series-title":"Springer Handbooks","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-30526-4_10","volume-title":"Springer Handbook of Model-Based Science","author":"A Aliseda","year":"2017","unstructured":"Aliseda, A.: The logic of abduction: an introduction. In: Magnani, L., Bertolotti, T. (eds.) Springer Handbook of Model-Based Science. SH, pp. 219\u2013230. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-30526-4_10"},{"key":"47_CR5","unstructured":"Anai, K., Yokoyama, K.: Algorithms of Quantifier Elimination and their Application: Optimization by Symbolic and Algebraic Methods [in Japanese]. University of Tokyo Press (2011)"},{"key":"47_CR6","volume-title":"Representing and Reasoning with Probabilistic Knowledge: A Logical Approach to Probabilities","author":"F Bacchus","year":"1990","unstructured":"Bacchus, F.: Representing and Reasoning with Probabilistic Knowledge: A Logical Approach to Probabilities. The MIT Press, Cambridge (1990)"},{"issue":"6","key":"47_CR7","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1145\/235809.235813","volume":"43","author":"S Basu","year":"1996","unstructured":"Basu, S., Pollack, R., Roy, M.F.: On the combinatorial and algebraic complexity of quantifier elimination. J. ACM 43(6), 1002\u20131045 (1996). https:\/\/doi.org\/10.1145\/235809.235813","journal-title":"J. ACM"},{"issue":"114","key":"47_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.2298\/PIM1614077B","volume":"100","author":"M Bori\u010di\u0107","year":"2016","unstructured":"Bori\u010di\u0107, M.: Inference rules for probability logic. PUBLICATIONS DE L\u2019INSTITUT MATH\u00c9MATIQUE 100(114), 77\u201386 (2016). https:\/\/doi.org\/10.2298\/PIM1614077B","journal-title":"PUBLICATIONS DE L\u2019INSTITUT MATH\u00c9MATIQUE"},{"key":"47_CR9","doi-asserted-by":"publisher","unstructured":"Bori\u010di\u0107, M.: Suppes-style sequent calculus for probability logic. J. Logic Comput. 27(4), 1157\u20131168 (10 2015). https:\/\/doi.org\/10.1093\/logcom\/exv068","DOI":"10.1093\/logcom\/exv068"},{"issue":"3","key":"47_CR10","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1017\/S1755020318000060","volume":"11","author":"H Brickhill","year":"2018","unstructured":"Brickhill, H., Horsten, L.: Triangulating non-archimedean probability. Rev. Symbolic Logic 11(3), 519\u2013546 (2018). https:\/\/doi.org\/10.1017\/S1755020318000060","journal-title":"Rev. Symbolic Logic"},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0049-237X(98)80016-5","volume-title":"Handbook of Proof Theory","author":"SR Buss","year":"1998","unstructured":"Buss, S.R.: An introduction to proof theory. In: Buss, S.R. (ed.) Handbook of Proof Theory, vol. 137, pp. 1\u201378. Elsevier, Amsterdam (1998)"},{"key":"47_CR12","doi-asserted-by":"publisher","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press (2002). https:\/\/doi.org\/10.1017\/CBO9780511809088","DOI":"10.1017\/CBO9780511809088"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"Enderton, H.B.: A Mathematical Introduction to Logic, 2nd edn. Academic Press (2000)","DOI":"10.1016\/B978-0-08-049646-7.50005-9"},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"Fagin, R., Halpern, J.Y., Megiddo, N.: A logic for reasoning about probabilities. Inf. Comput. 87(1), 78\u2013128 (1990)","DOI":"10.1016\/0890-5401(90)90060-U"},{"key":"47_CR15","unstructured":"Gallier, J.H.: Logic for Computer Science: Foundations of Automatic Theorem Proving, 2nd edn. Dover Publications (2015)"},{"key":"47_CR16","unstructured":"Gilio, A.: Precise propagation of upper and lower probability bounds in system p. arXiv preprint math\/0003046 (2000)"},{"key":"47_CR17","doi-asserted-by":"crossref","unstructured":"Hailperin, T.: Best possible inequalities for the probability of a logical function of events. Am. Math. Monthly 72(4), 343\u2013359 (1965)","DOI":"10.1080\/00029890.1965.11970533"},{"key":"47_CR18","doi-asserted-by":"crossref","unstructured":"H\u00e1jek, A.: Probability, logic, and probability logic. In: Goble, L. (ed.) The Blackwell Guide to Philosophical Logic, chap. 16, pp. 362\u2013384. Blackwell Publishing (2001)","DOI":"10.1111\/b.9780631206934.2001.00019.x"},{"key":"47_CR19","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y.: Reasoning About Uncertainty, 2nd edn. MIT Press (2017)","DOI":"10.7551\/mitpress\/10951.001.0001"},{"key":"47_CR20","doi-asserted-by":"crossref","unstructured":"Hobbs, J.R., Stickel, M.E., Appelt, D.E., Martin, P.: Interpretation as abduction. Artif. Intell. 63(1), 69\u2013142 (1993)","DOI":"10.1016\/0004-3702(93)90015-4"},{"key":"47_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/11518655_61","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"N Ikodinovi\u0107","year":"2005","unstructured":"Ikodinovi\u0107, N., Ognjanovi\u0107, Z.: A logic with coherent conditional probabilities. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 726\u2013736. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11518655_61"},{"key":"47_CR22","doi-asserted-by":"crossref","unstructured":"Kersting, K., De Raedt, L.: Bayesian logic programs. arXiv preprint cs.AI\/0111058 (2001). https:\/\/arxiv.org\/abs\/cs\/0111058","DOI":"10.1007\/3-540-44797-0_9"},{"key":"47_CR23","doi-asserted-by":"crossref","unstructured":"Kersting, K., De Raedt, L.: Bayesian logic programming: theory and tool. In: Getoor, L., Taskar, B. (eds.) Introduction to Statistical Relational Learning, pp. 291\u2013321. MIT Press (2007)","DOI":"10.7551\/mitpress\/7432.003.0012"},{"key":"47_CR24","unstructured":"McGee, V.: Learning the impossible. In: Eells, E., Brian, S. (eds.) Probability and Conditionals: Belief Revision and Rational Decision, pp. 179\u2013199. Cambridge University Press (1994)"},{"key":"47_CR25","doi-asserted-by":"publisher","unstructured":"Mishra, B.: Algorithmic Algebra. Monographs in Computer Science. Springer, New York (1993). https:\/\/doi.org\/10.1007\/978-1-4612-4344-1","DOI":"10.1007\/978-1-4612-4344-1"},{"key":"47_CR26","doi-asserted-by":"crossref","unstructured":"Mueller, E.T.: Commonsense reasoning: An Event Calculus Based Approach, 2nd edn. Morgan Kaufmann (2014)","DOI":"10.1016\/B978-0-12-801416-5.00002-4"},{"key":"47_CR27","unstructured":"Popper, K.: The Logic of Scientific Discovery, 2nd edn. Routledge (2002)"},{"issue":"1","key":"47_CR28","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M Richardson","year":"2006","unstructured":"Richardson, M., Domingos, P.: Markov logic networks. Mach. Learn. 62(1), 107\u2013136 (2006). https:\/\/doi.org\/10.1007\/s10994-006-5833-1","journal-title":"Mach. Learn."},{"issue":"1","key":"47_CR29","first-page":"37","volume":"4","author":"H Tabata","year":"2002","unstructured":"Tabata, H.: On second-order Peano arithmetic [in Japanese]. Tottori University Journal of the Faculty of Education and Regional Sciences 4(1), 37\u201384 (2002)","journal-title":"Tottori University Journal of the Faculty of Education and Regional Sciences"},{"key":"47_CR30","doi-asserted-by":"crossref","unstructured":"Tarski, A.: A Decision Method for Elementary Algebra and Geometry: Prepared for Publication with the Assistance of J.C.C. McKinsey. RAND Corporation, Santa Monica, CA (1951)","DOI":"10.1525\/9780520348097"},{"issue":"4","key":"47_CR31","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1093\/bjps\/55.4.747","volume":"55","author":"CG Wagner","year":"2004","unstructured":"Wagner, C.G.: Modus tollens probabilized. Brit. J. Phil. Sci. 55(4), 747\u2013753 (2004). https:\/\/doi.org\/10.1093\/bjps\/55.4.747","journal-title":"Brit. J. Phil. Sci."}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86772-0_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T04:13:48Z","timestamp":1699503228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86772-0_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030867713","9783030867720"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86772-0_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECSQARU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Symbolic and Quantitative Approaches with Uncertainty","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","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":"ecsqaru2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecsqaru.utia.cas.cz\/","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":"63","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":"48","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":"76% - 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.95","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.25","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)"}}]}}