.png){kind=icon}
.png){kind=icon}
Return
Extending Defeasibility for Propositional Standpoint Logics
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-04590-4_4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we introduce a new defeasible version of propositional standpoint logic by integrating Kraus et al.'s defeasible conditionals, Britz and Varzinczak's notions of defeasible necessity and distinct possibility, along with Leisegang et al.'s approach to defeasibility into the standpoint logics of Gomez Alvarez and Rudolph. The resulting logical framework allows for the expression of defeasibility on the level of implications, standpoint modal operators, and standpoint-sharpening statements. We provide a preferential semantics for this extended language and propose a tableaux calculus, which is shown to be sound and complete with respect to preferential entailment. We also establish the computational complexity of the tableaux procedure to be in PSPACE.
Keywords:
COMPLEXITY
KNOWLEDGE
Journal
L
IF:
0
Papers:
19
Citations:
0