UCT CS Research Document Archive

What Does Entailment for PTL Mean?

Booth, Richard, Giovanni Casini, Thomas Meyer and Ivan Varzinczak (2015) What Does Entailment for PTL Mean?. In Morgenstern, Leora, Theodore Patkos and Robert Sloan, Eds. Proceedings Twelfth International Symposium on Logical Formalization on Commonsense Reasoning (Commonsense), pages 39-45, Stanford, California, USA.

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

Abstract

We continue recent investigations into the problem of reason- ing about typicality. We do so in the framework of Propositional Typicality Logic (PTL), which is obtained by enriching classical propositional logic with a typicality operator and characterized by a preferential semantics a la KLM. In this paper we study different notions of entailment for PTL. We take as a starting point the notion of Rational Closure defined for KLM-style conditionals. We show that the additional expressivity of PTL results in different versions of Rational Closure for PTL — versions that are equivalent with respect to the conditional language originally proposed by KLM.

EPrint Type:Conference Paper
Subjects:I Computing Methodologies: I.2 ARTIFICIAL INTELLIGENCE
ID Code:1069
Deposited By:Meyer, Thomas
Deposited On:11 March 2016
Alternative Locations:https://www.aaai.org/ocs/index.php/SSS/SSS15/paper/viewFile/10280/10069