OATAO - Open Archive Toulouse Archive Ouverte Open Access Week

A reconstruction of default conditionals within epistemic logic

Koutras, Costas D. and Moyzes, Christos and Rantsoudis, Christos A reconstruction of default conditionals within epistemic logic. (2017) In: Annual ACM Symposium on Applied Computing (SAC 2017), 3 April 2017 - 7 April 2017 (Marrakech, Morocco).

[img] (Document in English)

PDF (Author's version) - Depositor and staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
265kB

Official URL: https://doi.org/10.1145/3019612.3019714

Abstract

Default conditionals are statements that express a condition of normality, in the form 'ifφ then normally ψ' and are of primary importance in Knowledge Representation. There exist modal approaches to the construction of conditional logics of normality. Most of them are built on notions of preference among possible worlds, corresponding to the semantic intuition that (φ ⇒ &psi) is true in a situation if in the most preferred (most 'normal') situations in which φ is true, &psi is also true. It has been noticed that there exist natural epistemic readings of a default conditional, but this direction has not been thoroughly explored. A statement of the form 'something known to be a bird, that can be consistently believed to fly, does fly' involves well-known epistemic attitudes and allows the possibility of defining defaults within the rich framework of Epistemic Logic. We pursue this direction here within KBE, a recently introduced S4.2-based modal logic of knowledge, belief and estimation. In this logic, knowledge is a normal S4 operator, belief is a normal KD45 operator and estimation is a non-normal operator interpreted as a 'majority' quantifier over the set of epistemically alternative situations. We define and explore various conditionals using the epistemic operators of KBE, capturing (φ ⇒ &psi) in various ways, including 'it is known that assuming φ allows us to assume φ ∧ &psi' or 'if φ is known and there is no reason to believe ¬ψ then ψ can be plausibly inferred'. Overall, we define here two weak nonmonotonic default conditionals, one monotonic conditional and two stronger nonmonotonic conditionals without axiom ID. Our results provide concrete evidence that the machinery of epistemic logic can be exploited for the study of default conditionals.

Item Type:Conference or Workshop Item (Paper)
Additional Information:Thanks to ACM. The definitive version is available at http://dl.acm.org This papers appears in SAC '17 : Proceedings of the Symposium on Applied Computing ISBN: 978-1-4503-4486-9 The original PDF is available at: https://dl.acm.org/citation.cfm?id=3019714
Audience (conference):International conference proceedings
Uncontrolled Keywords:
Institution:French research institutions > Centre National de la Recherche Scientifique - CNRS (FRANCE)
Université de Toulouse > Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Université de Toulouse > Université Toulouse III - Paul Sabatier - UT3 (FRANCE)
Université de Toulouse > Université Toulouse - Jean Jaurès - UT2J (FRANCE)
Université de Toulouse > Université Toulouse 1 Capitole - UT1 (FRANCE)
Other partners > University of Liverpool (UNITED KINGDOM)
Other partners > University of the Peloponnese - UOP (GREECE)
Laboratory name:
Statistics:download
Deposited On:03 Sep 2019 11:59

Repository Staff Only: item control page