{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:10:19Z","timestamp":1726042219077},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030290061"},{"type":"electronic","value":"9783030290078"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29007-8_7","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:10:06Z","timestamp":1566414606000},"page":"112-128","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mechanised Assessment of Complex Natural-Language Arguments Using Expressive Logic Combinations"],"prefix":"10.1007","author":[{"given":"David","family":"Fuenmayor","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Benzm\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.scico.2018.10.008","volume":"172","author":"C Benzm\u00fcller","year":"2019","unstructured":"Benzm\u00fcller, C.: Universal (meta-)logical reasoning: recent successes. Sci. Comput. Program. 172, 48\u201362 (2019)","journal-title":"Sci. Comput. Program."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Benzm\u00fcller, C., Farjami, A., Parent, X.: A dyadic deontic logic in HOL. In: Broersen, J., Condoravdi, C., Nair, S., Pigozzi, G. (eds.), Proceedings of DEON 2018\u2014Deontic Logic and Normative Systems, pp. 33\u201350. College Publications (2018)","DOI":"10.29007\/t29j"},{"issue":"1","key":"7_CR3","first-page":"7","volume":"7","author":"C Benzm\u00fcller","year":"2013","unstructured":"Benzm\u00fcller, C., Paulson, L.: Quantified multimodal logics in simple type theory. Log. Univers. (Spec. Issue Multimodal Log.) 7(1), 7\u201320 (2013)","journal-title":"Log. Univers. (Spec. Issue Multimodal Log.)"},{"key":"7_CR4","volume-title":"The Dialectical Necessity of Morality: An Analysis and Defense of Alan Gewirth\u2019s Argument to the Principle of Generic Consistency","author":"D Beyleveld","year":"1991","unstructured":"Beyleveld, D.: The Dialectical Necessity of Morality: An Analysis and Defense of Alan Gewirth\u2019s Argument to the Principle of Generic Consistency. UCP, Chicago (1991)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-14052-5_11","volume-title":"Interactive Theorem Proving","author":"JC Blanchette","year":"2010","unstructured":"Blanchette, J.C., Nipkow, T.: Nitpick: a counterexample generator for higher-order logic based on a relational model finder. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 131\u2013146. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14052-5_11"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MIS.2006.82","volume":"21","author":"S Bringsjord","year":"2006","unstructured":"Bringsjord, S., Arkoudas, K., Bello, P.: Toward a general logicist methodology for engineering ethically correct robots. IEEE Intell. Syst. 21(4), 38\u201344 (2006)","journal-title":"IEEE Intell. Syst."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-94-010-0387-2_4","volume-title":"Handbook of Philosophical Logic","author":"J Carmo","year":"2002","unstructured":"Carmo, J., Jones, A.J.I.: Deontic logic and contrary-to-duties. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 8, pp. 265\u2013343. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/978-94-010-0387-2_4"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1093\/analys\/24.2.33","volume":"24","author":"RM Chisholm","year":"1963","unstructured":"Chisholm, R.M.: Contrary-to-duty imperatives and deontic logic. Analysis 24, 33\u201336 (1963)","journal-title":"Analysis"},{"key":"7_CR9","unstructured":"Fuenmayor, D., Benzm\u00fcller, C.: Formalisation and evaluation of Alan Gewirth\u2019s proof for the principle of generic consistency in Isabelle\/HOL. Archive of Formal Proofs (2018). \n                      https:\/\/www.isa-afp.org\/entries\/GewirthPGCProof.html"},{"key":"7_CR10","unstructured":"Fuenmayor, D., Benzm\u00fcller, C.: Isabelle\/HOL sources associated with this paper. Github (2019). \n                      https:\/\/github.com\/davfuenmayor\/2DDDL"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-319-14726-0_5","volume-title":"Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation","author":"U Furbach","year":"2015","unstructured":"Furbach, U., Schon, C.: Deontic logic for human reasoning. In: Eiter, T., Strass, H., Truszczy\u0144ski, M., Woltran, S. (eds.) Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation. LNCS (LNAI), vol. 9060, pp. 63\u201380. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-14726-0_5"},{"key":"7_CR12","volume-title":"Reason and Morality","author":"A Gewirth","year":"1981","unstructured":"Gewirth, A.: Reason and Morality. University of Chicago Press, Chicago (1981)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Govindarajulu, N.S., Bringsjord, S.: On automating the doctrine of double effect. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17, pp. 4722\u20134730 (2017)","DOI":"10.24963\/ijcai.2017\/658"},{"key":"7_CR14","unstructured":"Kaplan, D.: Afterthoughts. In: Almog, J., Perry, J., Wettstein, H. (eds.), Themes from Kaplan, pp. 565\u2013614. Oxford University Press (1989)"},{"key":"7_CR15","unstructured":"Kaplan, D.: Demonstratives. In: Almog, J., Perry, J., Wettstein, H. (eds.), Themes from Kaplan, pp. 481\u2013563. Oxford University Press (1989)"},{"key":"7_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29354-7","volume-title":"Programming Machine Ethics","author":"LM Pereira","year":"2016","unstructured":"Pereira, L.M., Saptawijaya, A.: Programming Machine Ethics. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-29354-7"},{"key":"7_CR17","unstructured":"Schroeter, L.: Two-dimensional semantics. In: Zalta, E.N. (eds.), The Stanford Encyclopedia of Philosophy (2017). Summer 2017 edition"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29007-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:12:27Z","timestamp":1566414747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29007-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290061","9783030290078"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29007-8_7","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":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FroCoS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Frontiers of Combining Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"4 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"frocos2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.frocos2019.org\/","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":"30","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":"20","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":"67% - 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.1","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)"}}]}}