Question answering: from partitions to Prolog

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Question answering: from partitions to Prolog does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Question answering: from partitions to Prolog, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Question answering: from partitions to Prolog will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-620798

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.