Making Automatic Theorem Provers more Versatile

5 pages•Published: November 8, 2017

Abstract

We argue that automatic theorem provers should become more versatile and should be able to tackle problems expressed in richer input formats. Salient research directions include (i) developing tight combinations of SMT solvers and first-order provers; (ii) adding better handling of theories in first-order provers; (iii) adding support for inductive proving; (iv) adding support for user-defined theories and functions; and (v) bringing to the provers some basic abilities to deal with logics beyond first-order, such as higher-order logic.

Keyphrases: combinations, deduction modulo, first order, higher order, smt, theories

In: Giles Reger and Dmitriy Traytel (editors). ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, vol 51, pages 11-15.

Links:	https://easychair.org/publications/paper/81Q8
	https://doi.org/10.29007/n6j7

BibTeX entry

@inproceedings{ARCADE2017:Making_Automatic_Theorem_Provers,
  author    = {Simon Cruanes},
  title     = {Making Automatic Theorem Provers more Versatile},
  booktitle = {ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements},
  editor    = {Giles Reger and Dmitriy Traytel},
  series    = {EPiC Series in Computing},
  volume    = {51},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/81Q8},
  doi       = {10.29007/n6j7},
  pages     = {11-15},
  year      = {2017}}

Download PDF Open PDF in browser