Reference : On Rational Entailment for Propositional Typicality Logic
Reports : External report
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/37863
On Rational Entailment for Propositional Typicality Logic
English
Casini, Giovanni mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Meyer, Thomas mailto [University of Cape Town > Computer Science > > full professor]
Varzinczak, Ivan mailto [Universite d'Artois > CRIL > > maitre de conference]
Booth, Richard mailto [Cardiff University > Computer Science > > Lecturer]
2018
ArXiv
27
1809.10946
[en] nonmonotonic logics ; modal logics ; defeasible reasoning
[en] Propositional Typicality Logic (PTL) is a recently proposed logic, obtained
by enriching classical propositional logic with a typicality operator
capturing the most typical (alias normal or conventional) situations
in which a given sentence holds. The semantics of PTL is in terms of
ranked models as studied in the well-known KLM approach to preferential
reasoning and therefore KLM-style rational consequence relations can
be embedded in PTL. In spite of the non-monotonic features introduced
by the semantics adopted for the typicality operator, the obvious Tarskian
definition of entailment for PTL remains monotonic and is therefore not
appropriate in many contexts. Our first important result is an impossibility
theorem showing that a set of proposed postulates that at first all seem
appropriate for a notion of entailment with regard to typicality cannot be
satisfied simultaneously. Closer inspection reveals that this result is best
interpreted as an argument for advocating the development of more than
one type of PTL entailment. In the spirit of this interpretation, we investigate
three different (semantic) versions of entailment for PTL, each
one based on the definition of rational closure as introduced by Lehmann
and Magidor for KLM-style conditionals, and constructed using different
notions of minimality.
Researchers
http://hdl.handle.net/10993/37863
https://arxiv.org/abs/1809.10946v1
H2020 ; 690974 - MIREL - MIREL - MIning and REasoning with Legal texts

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
TR_ArXiv_PTL.pdfPublisher postprint359.09 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.