Skip to main content

PTL: A Propositional Typicality Logic

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNAI,volume 7519)

Abstract

We introduce Propositional Typicality Logic (PTL), a logic for reasoning about typicality. We do so by enriching classical propositional logic with a typicality operator of which the intuition is to capture the most typical (or normal) situations in which a formula holds. The semantics is in terms of ranked models as studied in KLM-style preferential reasoning. This allows us to show that rational consequence relations can be embedded in our logic. Moreover we show that we can define consequence relations on the language of PTL itself, thereby moving beyond the propositional setting. Building on the existing link between propositional rational consequence and belief revision, we show that the same correspondence holds for rational consequence and belief revision on PTL. We investigate entailment for PTL, and propose two appropriate notions thereof.

Keywords

  • Nonmonotonic reasoning
  • typicality
  • belief revision
  • rationality

This work is based upon research supported by the National Research Foundation. Any opinion, findings and conclusions or recommendations expressed in this material are those of the author(s) and therefore the NRF do not accept any liability in regard thereto. This work was partially funded by Project number 247601, Net2: Network for Enabling Networked Knowledge, from the FP7-PEOPLE-2009-IRSES call.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alchourrón, C., Gärdenfors, P., Makinson, D.: On the logic of theory change: Partial meet contraction and revision functions. Journal of Symbolic Logic 50, 510–530 (1985)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Boutilier, C.: Conditional logics of normality: A modal approach. Artificial Intelligence 68(1), 87–154 (1994)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Britz, K., Heidema, J., Labuschagne, W.: Semantics for dual preferential entailment. Journal of Phil. Logic 38, 433–446 (2009)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Britz, K., Meyer, T., Varzinczak, I.: Preferential reasoning for modal logics. Electronic Notes in Theoretical Computer Science 278, 55–69 (2011)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Britz, K., Meyer, T., Varzinczak, I.: Semantic Foundation for Preferential Description Logics. In: Wang, D., Reynolds, M. (eds.) AI 2011. LNCS (LNAI), vol. 7106, pp. 491–500. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  6. Britz, K., Varzinczak, I.: Defeasible modes of inference: A preferential perspective. In: 14th International Workshop on Nonmonotonic Reasoning, NMR (2012)

    Google Scholar 

  7. Crocco, G., Lamarre, P.: On the connections between nonmonotonic inference systems and conditional logics. In: Proc. KR, pp. 565–571. Morgan Kaufmann (1992)

    Google Scholar 

  8. Delgrande, J.P.: A first-order logic for prototypical properties. Art. Intel. 33, 105–130 (1987)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Gärdenfors, P., Makinson, D.: Nonmonotonic inference based on expectations. Artificial Intelligence 65(2), 197–245 (1994)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: A minimal model semantics for rational closure. In: 14th International Workshop on Nonmonotonic Reasoning, NMR (2012)

    Google Scholar 

  11. Giordano, L., Olivetti, N., Gliozzi, V., Pozzato, G.L.: \(\mathcal{ALC}+{T}\): a preferential extension of description logics. Fundamenta Informaticae 96(3), 341–372 (2009)

    MathSciNet  MATH  Google Scholar 

  12. Katsuno, H., Mendelzon, A.: Propositional knowledge base revision and minimal change. Artificial Intelligence 3(52), 263–294 (1991)

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44, 167–207 (1990)

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. Lehmann, D., Magidor, M.: What does a conditional knowledge base entail? Artificial Intelligence 55, 1–60 (1992)

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Booth, R., Meyer, T., Varzinczak, I. (2012). PTL: A Propositional Typicality Logic. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds) Logics in Artificial Intelligence. JELIA 2012. Lecture Notes in Computer Science(), vol 7519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33353-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33353-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33352-1

  • Online ISBN: 978-3-642-33353-8

  • eBook Packages: Computer ScienceComputer Science (R0)