Abstract
Choice logics constitute a family of propositional logics and are used for the representation of preferences, with especially qualitative choice logic (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 F is entailed by a QCL-theory T if F is true in all preferred models of T. 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 conjunctive choice logic (CCL) can be obtained in a straightforward way.
Original language | English |
---|---|
Title of host publication | Automated Reasoning |
Subtitle of host publication | 11th International Joint Conference Proceedings (IJCAR 2022) |
Editors | Jasmin Blanchette, Laura Kovács, Dirk Pattinson |
Publisher | Springer Science and Business Media Deutschland GmbH |
Pages | 331-349 |
Number of pages | 19 |
ISBN (Print) | 9783031107689 |
DOIs | |
Publication status | Published - 2022 |
Externally published | Yes |
Event | 11th International Joint Conference on Automated Reasoning, IJCAR 2022, part of the Federated Logic Conference, FLoC 2022 - Haifa, Israel Duration: 8 Aug 2022 → 10 Aug 2022 |
Publication series
Series | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 13385 LNAI |
ISSN | 0302-9743 |
Conference
Conference | 11th International Joint Conference on Automated Reasoning, IJCAR 2022, part of the Federated Logic Conference, FLoC 2022 |
---|---|
Country/Territory | Israel |
City | Haifa |
Period | 8/08/22 → 10/08/22 |
Bibliographical note
Publisher Copyright:© 2022, The Author(s).