Abductive Equivalential Translation and its application to Natural Language Database Interfacing

The thesis describes a logical formalization of natural-language database interfacing. We assume the existence of a ``natural language engine'' capable of mediating between surface linguistic string and their representations as ``literal'' logical forms: the focus of interest will be the question of relating ``literal'' logical forms to representations in terms of primitives meaningful to the underlying database engine. We begin by describing the nature of the problem, and show how a variety of interface functionalities can be considered as instances of a type of formal inference task which we call ``Abductive Equivalential Translation'' (AET); functionalities which can be reduced to this form include answering questions, responding to commands, reasoning about the completeness of answers, answering meta-questions of type ``Do you know...'', and generating assertions and questions. In each case, a ``linguistic domain theory'' (LDT) $\Gamma$ and an input formula $F$ are given, and the goal is to construct a formula with certain properties which is equivalent to $F$, given $\Gamma$ and a set of permitted assumptions. If the LDT is of a certain specified type, whose formulas are either conditional equivalences or Horn-clauses, we show that the AET problem can be reduced to a goal-directed inference method. We present an abstract description of this method, and sketch its realization in Prolog. The relationship between AET and several problems previously discussed in the literature is discussed. In particular, we show how AET can provide a simple and elegant solution to the so-called ``Doctor on Board'' problem, and in effect allows a ``relativization'' of the Closed World Assumption. The ideas in the thesis have all been implemented concretely within the SRI CLARE project, using a real projects and payments database. The LDT for the example database is described in detail, and examples of the types of functionality that can be achieved within the example domain are presented.

[1]  A. G. SmithOctober Declarative Derivation of Database Queries from Meaning Representations , 1991 .

[2]  Brian C. Williams,et al.  A Theory of Interactions: Unifying Qualitative and Quantitative Algebraic Reasoning , 1991, Artif. Intell..

[3]  Kurt Konolige The Database as Model: A Metatheoretic Approach , 1981 .

[4]  Hiyan Alshawi,et al.  Resolving Quasi Logical Forms , 1990, CL.

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

[6]  Robin Cooper,et al.  The syntax and semantics of when-questions , 1982 .

[7]  Douglas E. Appelt,et al.  TEAM: An Experiment in the Design of Transportable Natural-Language Interfaces , 1987, Artif. Intell..

[8]  R. Scha Logical foundations for question answering , 1983 .

[9]  H. Alshawi,et al.  The Core Language Engine , 1994 .

[10]  Leon Sterling,et al.  The Art of Prolog , 1987, IEEE Expert.

[11]  Hiyan Alshawi,et al.  Translation by Quasi Logical Form Transfer , 1991, ACL.

[12]  Jerry R. Hobbs,et al.  An Algorithm for Generating Quantifier Scopings , 1987, CL.

[13]  Gertjan van Noord,et al.  Semantic-Head-Driven Generation , 1990, Comput. Linguistics.

[14]  Manny Rayner,et al.  Finding out = Achieving Decidability , 1989 .

[15]  Douglas B. Moran,et al.  Quantifier Scoping in the SRI Core Language Engine , 1988, ACL.

[16]  Robert P. Goldman,et al.  A Logic for Semantic Interpretation , 1988, ACL.

[17]  Stephen G. Pulman,et al.  A speech-based route enquiry system built from general-purpose components , 1993, EUROSPEECH.

[18]  R. E. Korf,et al.  Search: A survey of recent results , 1988 .

[19]  Chris Mellish,et al.  Natural Language Processing in PROLOG , 1989 .

[20]  L. Karttunen Syntax and Semantics of Questions , 1977 .

[21]  Hiyan Alshawi,et al.  Monotonic Semantic Interpretation , 1992, ACL.

[22]  David Stallard,et al.  A Terminological Simplification Transformation for Natural Language Question-Answering Systems , 1986, HLT.

[23]  John McCarthy,et al.  Epistemological Problems of Artificial Intelligence , 1987, IJCAI.

[24]  Fernando Pereira,et al.  Categorial Semantics and Scoping , 1990, CL.

[25]  Stuart M. Shieber,et al.  Ellipsis and higher-order unification , 1991 .

[26]  Mark E. Stickel A prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler , 1986, CADE.

[27]  Michael Bennett,et al.  Questions in Montague grammar , 1979 .

[28]  Douglas E. Appelt,et al.  Making Abduction More Efficient , 1990, HLT.

[29]  Martha E. Pollack,et al.  Incremental Interpretation , 1991, Artif. Intell..