Question answering: from partitions to Prolog

Simple item page
dc.creatorCate, Balder D. ten
dc.creatorShan, Chung-chieh
dc.date2002-09-04
dc.date.accessioned2026-07-07T03:18:52Z
dc.date.available2026-07-07T03:18:52Z
dc.descriptionWe 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.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/cs/0209009
dc.identifierhttp://arxiv.org/abs/cs/0209009
dc.identifierProceedings 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
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31286
dc.subjectComputation and Language
dc.subjectArtificial Intelligence
dc.subjectLogic in Computer Science
dc.subjectF.4.1; I.2.3; I.2.7
dc.titleQuestion answering: from partitions to Prolog
dc.typetext

Files

Collections

arXiv