@inproceedings{Balder:2002,
  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.},
  added-at = {2007-12-14T02:37:17.000+0100},
  author = {ten Cate, Balder and chieh Shan, Chung},
  biburl = {http://www.bibsonomy.org/bibtex/27bc1e7d4b370103c868c43fcc90face7/diego_ma},
  booktitle = {Proc. TABLEAUX 2002},
  editor = {Egly, Uwe and Fermueller, Christian G.},
  interhash = {90d6484676cf6327f8fd2dbbe37f666a},
  intrahash = {7bc1e7d4b370103c868c43fcc90face7},
  keywords = {semantics questions prolog},
  note = {Also in Proc. NLULP 2002},
  pages = {251-265},
  series = {Lecture Notes in Artificial Intelligence 2381},
  timestamp = {2007-12-14T02:37:17.000+0100},
  title = {Question Answering: From Partitions to Prolog},
  url = {http://arxiv.org/abs/cs.CL/0209009},
  year = 2002
}