Proceedings

On the Entailment Problem for a Logic of Typicality

Richard Booth, Giovanni Casini, Thomas Andreas Meyer, Ivan José Varzinczak

Download BibTeX Cite

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Special Track on Knowledge Representation and Reasoning. Pages 2805-2810.

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 appropriate. We investigate different (semantic) versions of entailment for PTL, based on the notion of Rational Closure as defined by Lehmann and Magidor for KLM-style conditionals, and constructed using minimality. 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 satis- fied 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 define two primary forms of entailment for PTL and discuss their advantages and disadvantages.

Richard Booth, Giovanni Casini, Thomas Andreas Meyer, and Ivan José Varzinczak. 2015. On the Entailment Problem for a Logic of Typicality. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15. IJCAI, 2805–2810. https://ijcai.org/proceedings/2015/397
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards