Question answering: from partitions to Prolog
Computation and Language
2007-05-23 v1 Artificial Intelligence
Logic in Computer Science
Abstract
We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tableau theorem proving. The algorithm relies on a syntactic characterization of answerhood: Any answer to a question is equivalent to some formula built up only from instances of the question. We prove this characterization by translating the logic of interrogation to classical predicate logic and applying Craig's interpolation theorem.
Cite
@article{arxiv.cs/0209009,
title = {Question answering: from partitions to Prolog},
author = {Balder D. ten Cate and Chung-chieh Shan},
journal= {arXiv preprint arXiv:cs/0209009},
year = {2007}
}
Comments
15 pages