Download PDFOpen PDF in browser

We know (nearly) nothing!l But can we learn?

4 pagesPublished: November 8, 2017

Abstract

The greatest source of progress in automated theorem proving in the last 30 years has been the development of better search heuristics, usually based on developer experience and empirical evaluation, but increasingly also using automated optimization techniques. Despite this progress, we still know very little about proof search. We have mostly failed to identify good features for characterizing homogeneous problem classes, or for identifying interesting and relevant clauses and formulas.
I propose the challenge of bringing together inductive techniques (generalization and learning) and deductive techniques to attack this problem. Hardware and software have finally evolved to a point that we can reasonably represent and analyze large proof searches and search decisions, and where we can hope to achieve order-of-magnitude improvements in the efficiency of the proof search.

Keyphrases: automated theorem proving, deduction, heuristics, machine learning, search

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

BibTeX entry
@inproceedings{ARCADE2017:We_know_(nearly)_nothing!l,
  author    = {Stephan Schulz},
  title     = {We know (nearly) nothing!l But can we learn?},
  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/6kgF},
  doi       = {10.29007/n7rd},
  pages     = {29-32},
  year      = {2017}}
Download PDFOpen PDF in browser