2022/09/26 by Robert Freiman, Freiman, Robert, M Bernreiter +1
Computer Science · #03B60 #Advanced Algebra and Logic #Artificial Intelligence (cs.AI) #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #I.2.0 #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies
paper · pdf · doi:10.48550/arxiv.2209.12777
openalex publication_date 2022/09/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we introduce game-theoretic semantics (GTS) for Qualitative Choice Logic (QCL), which, in order to express preferences, extends classical propositional logic with an additional connective called ordered disjunction. Firstly, we demonstrate that game semantics can capture existing degree-based semantics for QCL in a natural way. Secondly, we show that game semantics can be leveraged to derive new semantics for the language of QCL. In particular, we present a new semantics that makes use of GTS negation and, by doing so, avoids problems with negation in existing QCL-semantics.