VSL 2014: VIENNA SUMMER OF LOGIC 2014

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

Authors: Negin Arhami and Geoff Sutcliffe

PapersPapers with AbstractsPrefaceAuthor IndexKeyword Index

Paper Information

Title:The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics
Authors:Negin Arhami and Geoff Sutcliffe
Proceedings:PAAR 2014 Proceedings
Editors: Stephan Schulz, Leonardo De Moura and Boris Konev
Keywords:Automated Theorem Proving, Logics, Translation
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.
Pages:10
Talk:Jul 23 11:15
Paper:
Disclaimer | Powered by EasyChair Smart Program