Revisiting Question Answering in Vampire

11 pages•Published: June 29, 2018

Abstract

Question answering is the process of taking a conjecture existentially quantified at the outer- most level and providing one or more instantiations of the quantified variable(s) as a form of an answer to the implied question. For example, given the axioms p(a) and f(a)=a the question ?[X] : p(f(X)) could return the answer X=a. This paper reviews the question answering prob- lem focussing on how it is tackled within the VAMPIRE theorem prover. It covers how VAMPIRE extracts single answers, multiple answers, disjunctive answers, and answers involving theories such as arithmetic. The paper finishes by considering possible future directions, such as integration with finite model finding.

Keyphrases: question answering, theorem proving, vampire

In: Laura Kovács and Andrei Voronkov (editors). Vampire 2017. Proceedings of the 4th Vampire Workshop, vol 53, pages 64-74.

Links:	https://easychair.org/publications/paper/5L6q
	https://doi.org/10.29007/fjc4

BibTeX entry

@inproceedings{Vampire17:Revisiting_Question_Answering_Vampire,
  author    = {Giles Reger},
  title     = {Revisiting Question Answering in Vampire},
  booktitle = {Vampire 2017. Proceedings of the 4th Vampire Workshop},
  editor    = {Laura Kovács and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {53},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/5L6q},
  doi       = {10.29007/fjc4},
  pages     = {64-74},
  year      = {2018}}

Download PDF Open PDF in browser