Progress in Automating Higher-Order Ontology Reasoning

11 pages•Published: May 16, 2012

Abstract

We report on the application of higher-order automated theorem proving in ontology reasoning. Concretely, we have integrated the Sigma knowledge engineering environment and the Suggested Upper-Level Ontology SUMO with the higher-order theorem prover LEO-II. The basis for this integration is a translation from SUMO representations into the new typed higher-order form representation language TPTP THF. We illustrate the benefits of our integration with examples, report on experiments and analyze open challenges.

Keyphrases: application in ontology reasoning, boolean extensionality and modalities, higher order theorem proving

In: Renate A. Schmidt, Stephan Schulz and Boris Konev (editors). PAAR-2010: Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning, vol 9, pages 22-32.

Links:	https://easychair.org/publications/paper/5z
	https://doi.org/10.29007/dtnz

BibTeX entry

@inproceedings{PAAR-2010:Progress_Automating_Higher_Order,
  author    = {Christoph Benzmüller and Adam Pease},
  title     = {Progress in Automating Higher-Order Ontology Reasoning},
  booktitle = {PAAR-2010: Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Renate A. Schmidt and Stephan Schulz and Boris Konev},
  series    = {EPiC Series in Computing},
  volume    = {9},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/5z},
  doi       = {10.29007/dtnz},
  pages     = {22-32},
  year      = {2012}}

Download PDF Open PDF in browser