Booth, Richard and Casini, Giovanni and Meyer, Thomas and Varzinczak, Ivan (2015) On the Entailment Problem for a Logic of Typicality, Proceedings of Twenty Fourth International Joint Conference on Artificial Intelligence (IJCAI), 25-31 July 2015, Buenos Aires, Argentina, 2805-2811, AAAI Press.
![[img]](http://pubs.cs.uct.ac.za/style/images/fileicons/application_pdf.png) |
PDF
IJCAI15-397.pdf Download (531kB) |
Abstract
Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator. 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 appro- priate. We investigate different (semantic) versions of entailment for PTL, based on the notion of Ra- tional Closure as defined by Lehmann and Magidor for KLM-style conditionals, and constructed using minimality. Our first important result is an impossi- bility theorem showing that a set of proposed postu- lates that at first all seem appropriate for a notion of entailment with regard to typicality cannot be satis- fied simultaneously. Closer inspection reveals that this result is best interpreted as an argument for ad- vocating the development of more than one type of PTL entailment. In the spirit of this interpretation, we define two primary forms of entailment for PTL and discuss their advantages and disadvantages.
| Item Type: | Conference paper |
|---|---|
| Subjects: | Computing methodologies > Artificial intelligence |
| Alternate Locations: | http://ijcai.org/papers15/Papers/IJCAI15-397.pdf |
| Date Deposited: | 11 Mar 2016 |
| Last Modified: | 10 Oct 2019 15:32 |
| URI: | http://pubs.cs.uct.ac.za/id/eprint/1070 |
Actions (login required)
 |
View Item |