The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics

10 pages•Published: July 5, 2015

Abstract

Many Automated Theorem Prover (ATP) systems for different logics, and
translators for translating different logics from one to another, have
been developed and are now available.
Some logics are more expressive than others, and it is easier to express
problems in those logics.
On the other hand, the ATP systems for less expressive logics have been
under development for many years, and are more powerful and reliable.
There is a trade-off between expressivity of a logic, and the power and
reliability of the available ATP systems.
Translators and ATP systems can be combined to try to solve
a problem.
In this research, an experiment has been carried out to compare the
performance of difference combinations of translators and ATP systems.

Keyphrases: automated theorem proving, description logics, epr, first order logic

In: Stephan Schulz, Leonardo De Moura and Boris Konev (editors). PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning, vol 31, pages 2-11.

Links:	https://easychair.org/publications/paper/XmCW
	https://doi.org/10.29007/kvb1

BibTeX entry

@inproceedings{PAAR-2014:Efficiency_Automated_Theorem_Proving,
  author    = {Negin Arhami and Geoff Sutcliffe},
  title     = {The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics},
  booktitle = {PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Stephan Schulz and Leonardo De Moura and Boris Konev},
  series    = {EPiC Series in Computing},
  volume    = {31},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/XmCW},
  doi       = {10.29007/kvb1},
  pages     = {2-11},
  year      = {2015}}

Download PDF Open PDF in browser