A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Proceedings of the 13th European Conference on Logics in Artificial Intelligence
We introduce Propositional Typicality Logic (PTL), a logic for reasoning about typicality. We do so by enriching classical proposi-tional logic with a typicality operator of which the intuition is to capture the most typical (or normal) situations in which a given formula holds. The semantics is in terms of ranked models as studied in KLM-style preferential reasoning. This allows us to show that KLM-style rational consequence relations can be embedded in our logic. Moreover we show that we canfatcat:fo5tdiyxknhl5kptlk4hi5ahqq