A Logic Prover for Text Processing

This paper demonstrates the applicability of automated reasoning to text processing, specifically to Question Answering. It is shown that the approach is feasible, effective, and scalable. A Logic Prover has been implemented and integrated into a state-of-the-art Question Answering System.

[1]  Yi Pan,et al.  Fast Parallel Algorithms for the Longest Common Subsequence Problem Using an Optical Bus , 2005, ICCSA.

[2]  Sanda M. Harabagiu,et al.  COGEX: A Logic Prover for Question Answering , 2003, NAACL.

[3]  Ellen M. Voorhees,et al.  Overview of the TREC 2002 Question Answering Track , 2003, TREC.

[4]  Sanda M. Harabagiu,et al.  Performance Issues and Error Analysis in an Open-Domain Question Answering System , 2002, ACL.

[5]  Vasile Rus,et al.  Logic Form Transformation of WordNet and its Applicability to Question Answering , 2001, ACL.

[6]  T. Picknett,et al.  Journal of Molecular Biology: a publishers perspective. , 1999, Journal of molecular biology.

[7]  Ophir Frieder,et al.  Parallel computation in biological sequence analysis , 1998 .

[8]  Hiroshi Imai,et al.  Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima , 1998 .

[9]  Sanjeev Saxena,et al.  Parallel algorithms for the longest common subsequence problem , 1997, Proceedings Fourth International Conference on High-Performance Computing.

[10]  Claus Rick,et al.  New Algorithms for the Longest Common Subsequence Problem , 1994 .

[11]  Jerry R. Hobbs,et al.  Interpretation as Abduction , 1993, Artif. Intell..

[12]  Alberto Apostolico,et al.  Fast Linear-Space Computations of Longest Common Subsequences , 1992, Theor. Comput. Sci..

[13]  Francis Y. L. Chin,et al.  A fast algorithm for computing longest common subsequences of small alphabet size , 1989 .

[14]  Anthony Preston,et al.  Book review: Automated Reasoning: 33 Basic Research Problems by Larry Wos (Prentice Hall 1988) , 1988, SGAR.

[15]  M. W. Du,et al.  Computing a longest common subsequence for a set of strings , 1984, BIT.

[16]  M Karel,et al.  Optimization methods and available software. Part 1. , 1984, Critical reviews in food science and nutrition.

[17]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[18]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

[19]  Mike Paterson,et al.  A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..

[20]  Daniel S. Hirschberg,et al.  Algorithms for the Longest Common Subsequence Problem , 1977, JACM.

[21]  H. T. Kung,et al.  On Finding the Maxima of a Set of Vectors , 1975, JACM.

[22]  D Sankoff,et al.  Matching sequences under deletion-insertion constraints. , 1972, Proceedings of the National Academy of Sciences of the United States of America.

[23]  Marry Ella Milhan.  University of New Brunswick Latin Workshop , 2018 .

[24]  J. Meigs,et al.  WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.

[25]  Dmitry Korkin,et al.  A New Dominant Point-Based Parallel Algorithm for Multiple Longest Common Subsequence Problem , 2022 .