DeepAI AI Chat
Log In Sign Up

Truth and Preferences – A Game Approach for Qualitative Choice Logic

by   Robert Freiman, et al.
TU Wien
Logic Industries

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.


page 1

page 2

page 3

page 4


A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction

Logic Programs with Ordered Disjunction (LPODs) extend classical logic p...

Logic Programming with Ordered Disjunction

Logic programs with ordered disjunction (LPODs) combine ideas underlying...

Lexicographic Logic: a Many-valued Logic for Preference Representation

Logical formalisms provide a natural and concise means for specifying an...

Alternating (In)Dependence-Friendly Logic

Hintikka and Sandu originally proposed Independence Friendly Logic (IF) ...

On the Unity of Logic: a Sequential, Unpolarized Approach

The present work aims to give a unity of logic via standard sequential, ...

Paraconsistency, resolution and relevance

Digraphs provide an alternative syntax for propositional logic, with dig...

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic

There are two major approaches to proof-theoretic semantics: proof-theor...