Question answering: from partitions to Prolog
<|reference_start|>Question answering: from partitions to Prolog: 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.<|reference_end|>
@article{cate2002question,
    title={Question answering: from partitions to Prolog},
    author={Balder D. ten Cate (Universiteit van Amsterdam) and Chung-chieh Shan
  (Harvard University)},
    journal={Proceedings of TABLEAUX 2002: Automated Reasoning with Analytic
  Tableaux and Related Methods, ed. Uwe Egly and Christian G. Fermueller,
  Lecture Notes in Artificial Intelligence 2381, 251-265; also in Proceedings
  of NLULP 2002, ed. Shuly Wintner},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0209009},
    primaryClass={cs.CL cs.AI cs.LO}
}