{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:22:52Z","timestamp":1743002572105,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031107689"},{"type":"electronic","value":"9783031107696"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":212,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Choice logics constitute a family of propositional logics and are used for the representation of preferences, with especially<jats:italic>qualitative choice logic<\/jats:italic>(QCL) being an established formalism with numerous applications in artificial intelligence. While computational properties and applications of choice logics have been studied in the literature, only few results are known about the proof-theoretic aspects of their use. We propose a sound and complete sequent calculus for preferred model entailment in QCL, where a formula\u00a0<jats:italic>F<\/jats:italic>is entailed by a QCL-theory\u00a0<jats:italic>T<\/jats:italic>if\u00a0<jats:italic>F<\/jats:italic>is true in all preferred models of\u00a0<jats:italic>T<\/jats:italic>. The calculus is based on labeled sequent and refutation calculi, and can be easily adapted for different purposes. For instance, using the calculus as a cornerstone, calculi for other choice logics such as<jats:italic>conjunctive choice logic<\/jats:italic>(CCL) can be obtained in a straightforward way.<\/jats:p>","DOI":"10.1007\/978-3-031-10769-6_20","type":"book-chapter","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T01:02:56Z","timestamp":1659315776000},"page":"331-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sequent Calculi for\u00a0Choice Logics"],"prefix":"10.1007","author":[{"given":"Michael","family":"Bernreiter","sequence":"first","affiliation":[]},{"given":"Anela","family":"Lolic","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Maly","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"key":"20_CR1","first-page":"1","volume-title":"Logic: From Foundations to Applications","author":"A Avron","year":"1996","unstructured":"Avron, A.: The method of hypersequents in the proof theory of propositional nonclassical logics. In: Hodges, W., Hyland, M., Steinhorn, C., Truss, J. (eds.) Logic: From Foundations to Applications, pp. 1\u201332. Oxford Science Publications, Oxford (1996)"},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10817-013-9273-x","volume":"51","author":"M Baaz","year":"2013","unstructured":"Baaz, M., Lahav, O., Zamansky, A.: Finite-valued semantics for canonical labelled calculi. J. Autom. Reason. 51(4), 401\u2013430 (2013)","journal-title":"J. Autom. Reason."},{"doi-asserted-by":"crossref","unstructured":"Benferhat, S., Sedki, K.: Alert correlation based on a logical handling of administrator preferences and knowledge. In: SECRYPT, pp. 50\u201356. INSTICC Press (2008)","key":"20_CR3","DOI":"10.5220\/0001924000500056"},{"doi-asserted-by":"crossref","unstructured":"Bernreiter, M., Maly, J., Woltran, S.: Choice logics and their computational properties. In: IJCAI, pp. 1794\u20131800. ijcai.org (2021)","key":"20_CR4","DOI":"10.24963\/ijcai.2021\/247"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1145\/505372.505374","volume":"3","author":"PA Bonatti","year":"2002","unstructured":"Bonatti, P.A., Olivetti, N.: Sequent calculi for propositional nonmonotonic logics. ACM Trans. Comput. Log. 3(2), 226\u2013278 (2002)","journal-title":"ACM Trans. Comput. Log."},{"unstructured":"Boudjelida, A., Benferhat, S.: Conjunctive choice logic. In: ISAIM (2016)","key":"20_CR6"},{"issue":"1\u20132","key":"20_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.artint.2004.04.006","volume":"157","author":"G Brewka","year":"2004","unstructured":"Brewka, G., Benferhat, S., Berre, D.L.: Qualitative choice logic. Artif. Intell. 157(1\u20132), 203\u2013237 (2004)","journal-title":"Artif. Intell."},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1111\/j.0824-7935.2004.00241.x","volume":"20","author":"G Brewka","year":"2004","unstructured":"Brewka, G., Niemel\u00e4, I., Syrj\u00e4nen, T.: Logic programs with ordered disjunction. Comput. Intell. 20(2), 335\u2013357 (2004)","journal-title":"Comput. Intell."},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"473","DOI":"10.2307\/2274395","volume":"52","author":"WA Carnielli","year":"1987","unstructured":"Carnielli, W.A.: Systematization of finite many-valued logics through the method of tableaux. J. Symb. Log. 52(2), 473\u2013493 (1987)","journal-title":"J. Symb. Log."},{"doi-asserted-by":"crossref","unstructured":"Geibinger, T., Tompits, H.: Sequent-type calculi for systems of nonmonotonic paraconsistent logics. In: ICLP Technical Communications. EPTCS, vol. 325, pp. 178\u2013191 (2020)","key":"20_CR10","DOI":"10.4204\/EPTCS.325.23"},{"key":"20_CR11","first-page":"193","volume":"4","author":"G Governatori","year":"2006","unstructured":"Governatori, G., Rotolo, A.: Logic of violations: a Gentzen system for reasoning with contrary-to-duty obligations. Australas. J. Logic 4, 193\u2013215 (2006)","journal-title":"Australas. J. Logic"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s11787-021-00274-5","volume":"15","author":"M Kaminski","year":"2021","unstructured":"Kaminski, M., Francez, N.: Calculi for many-valued logics. Log. Univers. 15(2), 193\u2013226 (2021)","journal-title":"Log. Univers."},{"key":"20_CR13","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-319-08852-5_14","volume-title":"Information Processing and Management of Uncertainty in Knowledge-Based Systems","author":"L Li\u00e9tard","year":"2014","unstructured":"Li\u00e9tard, L., Hadjali, A., Rocacher, D.: Towards a gradual QCL model for database querying. In: Laurent, A., Strauss, O., Bouchon-Meunier, B., Yager, R.R. (eds.) IPMU 2014. CCIS, vol. 444, pp. 130\u2013139. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08852-5_14"},{"issue":"1\u20132","key":"20_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J McCarthy","year":"1980","unstructured":"McCarthy, J.: Circumscription - a form of non-monotonic reasoning. Artif. Intell. 13(1\u20132), 27\u201339 (1980)","journal-title":"Artif. Intell."},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"RC Moore","year":"1985","unstructured":"Moore, R.C.: Semantical considerations on nonmonotonic logic. Artif. Intell. 25(1), 75\u201394 (1985)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"20_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artif. Intell. 13(1\u20132), 81\u2013132 (1980)","journal-title":"Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Tiomkin, M.L.: Proving unprovability. In: LICS, pp. 22\u201326. IEEE Computer Society (1988)","key":"20_CR17","DOI":"10.1109\/LICS.1988.5097"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10769-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T09:31:02Z","timestamp":1727688662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10769-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031107689","9783031107696"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10769-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Automated Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haifa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2022","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":"ijcar2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easychair.org\/smart-program\/FLoC2022\/IJCAR-index.html","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":"85","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":"32","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":"9","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":"38% - 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.2","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":"5.2","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)"}}]}}