UCT CS Research Document Archive

On the Entailment Problem for a Logic of Typicality

Booth, Richard, Giovanni Casini, Thomas Meyer and Ivan Varzinczak (2015) On the Entailment Problem for a Logic of Typicality. In Yang, Qiang, Eds. Proceedings Twenty Fourth International Joint Conference on Artificial Intelligence (IJCAI), pages 2805-2811, Buenos Aires, Argentina.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.


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.

EPrint Type:Conference Paper
Subjects:I Computing Methodologies: I.2 ARTIFICIAL INTELLIGENCE
ID Code:1070
Deposited By:Meyer, Thomas
Deposited On:11 March 2016
Alternative Locations:http://ijcai.org/papers15/Papers/IJCAI15-397.pdf