2002/09/04 by Balder D. ten Cate, Chung-chieh Shan
Computer Science · #cs.CL #cs.AI #cs.LO
published as 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 · 15 pages
arxiv created 2002/09/04 · arxiv updated 2009/11/30
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.