Semantic Inference in Natural Language: Validating a Tractable Approach
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Natural Language. Pages 1346-1352.
© 1995 International Joint Conferences on Artificial Intelligence
Abstract
This paper is concerned with an inferential approach to information extraction, reporting in particular on the results of an empirical study that was performed to validate the approach. The study brings together two lines of research: (I) the RHO framework for tractable terminological knowledge representation, and (2) the Alembic message understanding system. There are correspondingly two principal aspects of interest to this work. From the knowledge representation perspective, the present study serves to validate experimentally a normal form hypothesis that guarantees tractability of inference in the RHO framework. From the message processing perspective, this study substantiates the utility of limited inference to information extraction.
- Aberdeen, J., Burger, J. , Connolly, D., Roberts, S., and Vilain, M. (1993). "MITRE-Bedford: Description of the Alembic system as used for MUC-5". In [
- [Sundheim, 1993] .
- Alshawi, H. and Van Eijck, J. (1989). "Logical forms in the core language engine". In Prcdgs. of ACL89. Vancouver, BC .
- Bayer, S. and Vilain, M. (1991). "The relation-based know- ledge representation of King Kong". Sigart Bulletin 2(3) .
- Brachman, R. J. , Borgida, A. , McGuiness, D. L. , & Patel- Schneider, P. F. (1991). "Living with CLASSIC''. In Sowa, J. , ed ., Principles of Semantic Networks. San Mateo, CA: Morgan-Kaufmann.
- Brachman, R. J. and Levesque, H. (1984). "The tractability of subsumption in frame-based description languages". In Prcdgs. of AAA/84. Austin, TX.
- Brachman, R. J . and Schmolze, J . (1985) . "An overview of the KL-ONE knowledge representation system". Cog. Sci.
- Garey , M. R. and Johnson, D. S. (1979). Computers and Intractability. New York: W. H. Freeman. Haddock, N. J., (1992). "Semantic evaluation as constraint network consistency". In Prcdgs. of AAA/92. San Jose, CA.
- Hobbs, J. R. (1985). "Ontological promiscuity". In Prcdgs. of ACL85. Chicago, IL, 119-124.
- Hobbs, J. R. and Shieber, S. M . (1987) . "An algorithm for generating quantifier scopings". Comput. Linguistics 13(1-2).
- Jacobs, P. S. (1988) . "Concretion: Assumption-based under- standing". In Prcdgs. of COLINGBB. Budapest.
- MacGregor, R. (1991). "Inside the LOOM description classifier". Sigart Bulletin 2(3).
- Nebel, B. (1988). "Computational complexity of termino- logical reasoning in BACK". Artificial Intelligence 34(3).
- Nebel, B. (1990). "Terminological reasoning in inherently intractable". Artificial Intelligence 43.
- Patel-Schneider, P. F. (1989). Undecidability of subsumption in NIKL. Artificial Intelligence 39.
- Schmidt-SchauB, M. (1989). "Subsumption in KL-ONE is undecidable". In Prcdgs. of KR89. Toronto, ON.
- Stallard, D . G. (1986) . "A terminological simplification transformation for natural language question-answering systems". In Prcdgs. of ACL86. New York, NY .
- Sundheim, B., ed. (1992). Prcdgs. of the Fourth Message Understanding Conf (MUC-4), McLean, VA.
- Sundheim, B., ed. (1993 ). Prcdgs. of the Fifth Message Understanding Conf (MUC-5), Baltimore, MD.
- Vilain, M . (1991) . "Deduction as parsing: tractable classification in the KL-ONE framework". In Prcdgs. of AAA/91. Anaheim, CA.
References were extracted automatically from the PDF and may contain errors.
Full text extracted automatically from the PDF; figures, tables and equations may differ. The PDF is the version of record.
1 Some background
The broad focus of this work has been an attempt to exploit tractable inference in a complex and realistic natural lan guage processing task. The task in question is information extraction, that is, the process of populating a fixed-field database with information extracted from free-form natural language text. The computational framework in which we have explored this research has been the Alembic message understanding system [Aberdeen et al., 1993] . As with many such systems, the extraction process in Alembic occurs through pattern matching against the semantic represen tation of sentences. These representations are themselves derived from parsing the input text.
That this kind of approach can yield high performance in data extraction is amply documented in [Sundheim, 1992; 1993]. We have found-as have others-that good results can be obtained with only sketchy sentence semantics (as can happen when there are gaps in the lexicon's semantic assignments). In addition, when the parser normalizes such semantic phenomena as argument passing, the number of extraction patterns can be relatively small.
Strict semantic pattern-matching is unattractive, however, in cases that presume some degree of inference. Consider the following example of what one might term an East-West joint venture (our examples here are either derived or close ly inspired from a standard extraction task from the Fifth Message Understanding Conference, that of identifying business partnerships and joint ventures in news wire text).


Figure 1: A predicate taxonomy X I hq-in agceew
Figure 2: Dependency trees for variables in axioms ( 1 ), on the left, and (4), on the right.
2 The RHO framework
The RHO framework arose in reaction to the approach to ter minological reasoning embodied in most descendants of KL ONE, e.g., CLASSIC [Brachman et al., 1991], BACK [Nebel, 1988], LOOM [MacGregor, 1991], etc. This line of work has come to place a major emphasis on computing concept subsumption, i.e., the determination of whether a represen tational description (a concept) necessarily entails another description~ In our view, this emphasis is mistaken.
Indeed, this emphasis ignores the way in which practical applications have successfully exploited the terminological framework. These systems primarily rely on the operation of classification, especially instance classification. Though subsumption offers a semantic model of classification, it does not necessarily follow that it should provide its computational underpinnings.
In addition, the emphasis on complete subsumption algo rithms has led to restricted languages that are representatio nally weak. Such languages have been the subject of increasingly pessimistic theoretical results, from intracta bility of subsumption [Brachman and Levesque, 1984], to undecidability of subsumption [Schrnidt-SchauB, 1989; Patel Schneider, 1989], to intractability of the fundamental norma lization of a terminological KB [Nebel, 1990].
Against this background, RHO was targeted to support instance classification, and thus departs in significant ways from traditional terminological reasoners. The most draconian departure is in separating the normal termino logical notion of necessary and sufficient definitions into separate sufficiency axioms and necessity axioms. The thrust of the former is to provide the kind of antecedent inference that is the hallmark of classification, e.g.,
The role of necessity conditions is to provide consequent inference such as that typically associated with inheritance and sort restrictions on predicates, e.g.,
organization (x) ~corporation (x) (2) corporation (x) ~western-corp (x) (3) organization (x) ~agreement (x, y. z) (4)
Although both classes of axioms are expressed in the same syntactic garb, namely function-free Horn clauses, they differ with respect to their inferential import. If one thinks of predicates as being organized according to some taxonomy (see Fig. 1), then necessity axioms encode infe rence that proceeds up the hierarchy (i.e., inheritance), while sufficiency axioms encode inference that proceeds down the hierarchy (i.e., classification).
The most interesting consequence of RHO's uniform language for necessity and sufficiency is that it facilitates the formulation of a criterion under which classification is guaranteed to be tractable. For a knowledge base to be guaranteed tractable, the criterion requires that there be a tree shape to the implicit dependencies between the variables in any given axiom in the knowledge base.
For the sample axioms above, Fig. 2 informally illustrates this notion of variable dependencies. Axiom (1), for example, mentions two variables, x and y. A dependency between these variables is introduced by the predicative term hq-in(x.y): the term makes the two variables dependent by virtue of mentioning them as arguments of the same predicate. As the axiom mentions no other variables, its dependency graph is the simple tree on the left of Fig. 1. Similarly, in axiom (4) the agreement predicate makes both y and z dependent on x, also yielding a tree. Finally, axioms (2) and (3) lead to degenerate trees containing only x. Since all the dependency relations between these variables are tree-shaped, the knowledge base formed out of their respective axioms is tractable under the criterion. A formal proof that tractability follows from the criterion is in [Vilain, 1991]; an improved version appears in appendix Abelow.
3 Inferential data extraction
In Alembic, terminological inference is applied relatively early in the process of semantic interpretation. Specifically, inference is allowed to take place almost directly on the semantic structures that are produced by the parser interpreter. As our inference axioms are propositional in nature, but the semantic representations produced by Alembic are not strictly propositional, this procedure is mediated by a "propositionalization" phase that maps from the language of interpretations to that of propositions.
3.1 Semantic representation in Alembic
Alembic produces semantic representations at the popular interpretation level [Alshawi and Van Eijck, 1989, Hobbs and Shieber 1987]. That is, instead of generating fully scoped and disambiguated logical forms, Alembic produces representations that are ambiguous with respect to quantifier scoping. For example, the noun phrase "a gold-based ruble" maps into something akin to the following interpretation:
[ [head ruble] [quant :exists] [args NIL] [proxy P117] [mods { [ [head basis-of] [args { P117 [ [head gold] [quant :kind]]}]]}]]
Semantic heads of phrases are mapped to the head slot of the interpretation, arguments are mapped to the args slot, modifiers to the mods slot, and generalized quantifiers to the quant slot. The proxy slot contains a unique variable designating the individuals that satisfy the interpretation. If this interpretation were to be fully mapped to a sorted first order logical form, it would result in the following sentence, where gold is treated as a kind individual:
Details of this framework are in [Bayer and Vilain, 1991].
3.2 Conversion to propositional form
The propositionalization procedure crucially exploits the proxy variables around which interpretations are built. In brief, the propositionalization mapping hyper-Skolemizes these proxy variables and then recursively flattens the interpretation's modifiers.
For example, the interpretation for "a gold-based ruble" is mapped to the following propositions:
The interpretation has been flattened by pulling its modifier to the same level as the head proposition (yielding an implicit overall conjunction). In addition, the proxy variable has been interpreted as a Skolem constant, in this case the "gensymed" individual P117.1 This yields a database of propositions over which inference can be allowed to proceed. Say for the sake of argument that we had the following trivial rule:
Allowing this rule to apply to the propositional form of the interpretation above would yield the conclusion
3.3 Issues of quantifier scoping and model theory
Note that the interpretation of proxies as Skolem constants is actually hyper-Skolemization, because we perform it on universally quantified proxies as well as on existentially quantified ones. Ignoring issues of negation and disjunc tion, this unorthodox Skolemization process has a disarming model-theoretic justification. For a given interpretation with proxy variables V1 ... Vn, we simply read V1 ... Vn as directly designating some individuals t1 ... tn that would satisfy the interpretation in some model 1.1 (wherein the interpretation will have received some unambiguous scoping of its quantifiers). Consider now P1(V1 ... Vn) ... Pm(V1 ... Vn), the propositions that are mentioned in the interpretation. By definition then, 1t1(t1 ... tn) ... 1tm(t1 ... tn). will be satisfied in any such model jl, where the 7ti are the interpretations in 1.1 of the Pi. The crux is to note that any material implication that is valid in some model of the interpretation will necessarily be valid in all models of the interpretation. Since our terminological axioms just perform a simple kind of material implication, it follows that the inferences that they draw will be valid in any model of the interpretation. More importantly, they will remain so under any scoping of the interpretation's quantifiers.
1 This glosses over event reference, which we address in a partly Davidsonian framework, as in [Hobbs, 1985]
To see this, consider the notorious example "every man loves a woman." This sentence has two readings, depending on the scoping of the quantifiers: the common \:f -3 reading (every man has a corresponding woman) and the infamous 3-\:f scoping (there is but one object of affection-Margaret Thatcher or Marilyn Monroe are the usual candidates).
Regardless of the scoping, though, the interpretation of the sentence is propositionalized as:
Given our reading of proxies, note that under either quantifier scoping, P118 will necessarily designate a man, P119 will necessarily designate a woman, and the loves relationship will necessarily hold between them. · Now, say we had the following inference rule:
Applying this rule to the propositionalization yields: romance(P118,P119)
Once again, this inference is valid regardless of the ultimate scoping selected for the quantifiers. This demon strates a very practical property of our approach, namely that it enables inference to be performed over ambiguously scoped text, without requiring heuristic resolution of the scope ambiguity (and without expensive theorem proving).
4 Validating RHO
This approach to semantic inference is technically appealing for the simplicity of its inferential framework, and for the fact that it can apply so early in the semantic interpretation process. Neither characteristic is typical of traditional natural language systems that support inference.
Nevertheless, the practical import of our approach would be greatly diminished if it turned out to be (1) too simple to represent useful forms of inference, or (2) too compu tationally onerous in practice. These are both empirical questions, and as noted above, we strove to address them by first undertaking a paper study in which we applied the approach to a data extraction task. It was not particularly obvious how to address the first of these concerns in a clearly quantifiable way, so we were mostly concerned with addressing the issue of computational cost. Our goal in particular was to demonstrate that the tractability criterion we outlined above could in fact be met in practice.
Towards this end, my colleagues and I assembled a set of unbiased texts on Soviet economics. The validation task then consisted of deriving a set of terminological rules that would allow RHO to perform the inferential pattern matching necessary to extract from these texts all instances of a pre determined class of target concepts. The hypothesis that RHO's tractability criterion can be met in practice would thus be considered validated just in case this set of inference rules was tractable under the criterion.
4.1 Some assumptions
At the time that we undertook the study, however, the Alembic implementation was still in its infancy. We thus had to make a number of assumptions about what could be expected out of Alembic's parsing and semantic composition components. In so doing, we took great pain not to require superhuman performance on the part of the parser, and restricted our expected syntactic coverage to phenomena that we felt were well within the state of the art, and that subsequently were implemented in the running system.
In particular, we did not require spanning parses of a sen tence. As with similar systems, Alembic uses a fragment parser that produces partial syntactic analyses when its grammar fails to derive S. In addition, we exploited Alembic's hierarchy of syntactic categories, and postulated a number of relatively fine-grained categories that were not currently in the system. This allowed us for example to assume we could obtain the intended parse of "Irish-Soviet airline" on the basis of the pre-modifiers being both adjectives of geographic origin (and hence co-ordinable).
We also exploited the fact that the Alembic grammar is highly lexicalized (being based on the combinatorial categorial framework). This allowed us to postulate some fairly detailed subcategorization frames for verbs and their nominalizations. As is currently the case with our system, we assumed that verbs and their nominalizations are canonicalized to identical semantic representations. We also assumed basic competence at argument-passing, a characteristic already in place in the system.
4.2 The validation corpus
With these assumptions in mind, we assembled a corpus of data extraction inference problems in the area of Soviet economics. The corpus consisted of text passages that had been previously identified for an evaluation of information retrieval techniques in this subject area. The texts were drawn from over 6200 Wall Street Journal articles from 1989 that were released through the ACL-DCI. These articles were filtered (by extensive use of GREP) to a subset of 30~odd articles mentioning the then-extant Soviet Union. These articles were read in detail to locate all passages on a set of three pre-determined economic topics:
- o East-West joint ventures, these being any business arrangements between Soviet and non-Soviet agents.
- o Hard currency, being any discussion of attempts to introduce a convertible unit of monetary value in the former USSR.
- o Private cooperatives, i.e., employee-owned enter prises within the USSR.
We found 85 such passages in 74 separate articles (1.2% of the initial set of articles under consideration).
Among these, 47 passages were eliminated as they were just textual mentions of the target concepts (e.g. the string ')oint venture") or of some simple variant. These passages could easily be identified by Boolean keyword search-not a particularly insightful validation of a complex NL-based process! Unfortunately, this removed all instances of private cooperatives from the corpus, because in these texts, the word "cooperative" is a perfect predictor of the concept. An additional four passages were also removed during a cross-rater reliability verification. These were all amplifi cations of an earlier instance of one of the target concepts, e.g. , "U.S. and Soviet officials hailed the joint project." These passages were eliminated because the corpus collectors had differing intuitions as to whether they were sufficient indications in and of themselves of the target concepts, or were somehow pragmatically "parasitic" upon earlier instances of the target concept. The remaining 34 passages required some degree of terminological inference, and formed the corpus for this study.
| target | occurrenceB, n | Bufficiency ruleB, r | rule denBity, r/n |
|---|---|---|---|
| joint venture | 12 | 17 | 1.4 |
| hard curr. | 22 | 13 | .59 |
5 Findings
We then set about writing a collection of terminological axioms to handle this corpus. We honestly expected that the resulting axioms would not all meet the tractability criterion. Natural language is notoriously complex, and even such classic simple KL-ONE concepts as Brachman's arch [Brachman and Schmolze, 1985] do not meet the criterion.
What we found took us by surprise. We came across many examples that were challenging at various levels: complex syntactic phenomena, nightmares of reference resolution, and the ilk. However, once the corpus passages were mapped to their corresponding interpretations, the terminological axioms necessary to perform data extraction from these interpretations all met the criterion.
Table I, above, summarizes these findings. To cover our corpus of 34 passages, we required between two and three dozen sufficiency rules, depending upon how one encoded certain economic concepts, and depending on what assumptions one made about argument-passing in syntax. We settled on a working set of thirty such rules.
Note that this inventory does not include any necessity rules. We ignored necessity rules for the present purposes in part because they only encode inheritance relationships. The size of their inventory thus only reflects the degree to which one chooses to model intermediate levels of the domain hierarchy. For this study, we could arguably have used none. In addition, necessity rules are guaranteed to meet the tractability criterion, and were consequently of only secondary interest to our present objectives.
Because this validation corpus turned out to be fairly small, the conclusions to be drawn from it could only be considered somewhat preliminary. Nevertheless, we were very much encouraged by the relative ease with which we were able to write rules that met the tractability criterion. We just didn't seem to find any counterexamples in this data extraction task. The fact that the task was both non-trivial and independently motivated was particularly encouraging.
This approach to semantic inference and data extraction was also applied in the version of Alembic that we fielded for the Fifth Message Understanding Conference. As noted, the domain in this case was a far more complex modei of joint ventures, requiring identification of all companies involved in some joint activity, their corporate officers (if mentioned), the geographic locations of the companies, the product of the activity, and more-much more.

Once again, we found to our pleasure that the inference rules required to cover this expanded task all met the tracta bility criterion. In this particular case, we ended up with a set of 97 rules, with coverage breaking down as follows .
- Linguistic phenomena (23 rules), covering collo cations, argument passing, and certain contractions.
- General knowledge and inference (19 rules), for instance geography or time.
- Domain specific inference (56 rules), covering the particulars of the domain.
In both our paper study and our MUC-5 system, the rules we ended up writing were largely pedestrian, even boring. Most rules have three terms: two unary predicates and a relation linking them. Predicate valence is never greater than three, and only a handful of axioms yield dependency trees more exotic than a simple linear sequence of variables.
6 Some speculations
Both our paper study and our experience with MUC-5 can be taken as empirical indications that the tractability criterion in RHO is indeed a realistic restriction. It is our belief that tractable non-trivial inference is thus a practical reality, even in applications as complex as data extraction systems. Buoyed as we were by these results, we began to question whether they might not be due to some general character istics of language. In fact, this seems to be tantalizingly so.
In particular, the intractable class of axioms is closely implicated with anaphora resolution, one of the classic hard problems in natural language processing. To be specific, axioms that violate the tractability criterion can only be satisfied by sentences that display some kind of anaphora, such as pronouns or definite references.
This can be seen by considering the way in which chains of proxy individuals are formed in the process of semantic composition. In particular, proxies are introduced by the heads of noun phrases, and are chained together either by application of the verb phrase or by noun phrase modifiers. For example, the sentence "a man owns a cat" introduces two proxies that are chained by the verb "own":
The same propositionalization is produced with the analogous NP/relative clause combination "a man who owns a cat." Similar chains are also produced for prepositional phrase attachment, participial VP modifiers and other forms of NP modification. Note however, that in the absence of anaphora, these chains are constructed independently. No chain may refer to variables drawn from another chain, an observation, noted in another context by Haddock [1992].
Consider for example "a man who owns a cat and who owns a dog," which propositionalizes as:
own(P122, P123)
man(P122) cat(P123) dog(P124)
own(P122, P124)
The chaining between these variables is a simple tree (see Fig. 3, left tree). For the chaining to yield a true graph would in this case require the dog in one modifier to refer to the cat in the other, as would happen if the KB contained:
Adding this proposition to the K B yields a circular chaining of proxies, as in the right tree of Fig. 3: Crucially, such circularities can only arise through anaphoric reference, as in "a man who owns a cat and owns a dog that chases the cat," or like cases ("chases it/his cat/that cat").
This only addresses the construction of circular proxy chains among the propositionalizations of the linguistic input, not among the terms of inference axioms. The crucial observation, however, is that absent such circular proxy chains in the KB, axioms that are outside the criterion fail to be satisfied. Indeed, an axiom is outside the criterion just in case the variables in its terms exhibit non-tree-like dependencies, as in the following silly rule:
For these terms to match against the linguistic KB, propo sitions in the KB must exhibit corresponding circularities, which only happens if the linguistic input is anaphoric.
It is especially important not to assume that the converse of this result holds. That is, just because axioms that fail the criterion can only be satisfied by the propositionalization of anaphora, it is not the case that anaphoric use of language leads to intractability. Criterion-passing axioms lead to tractable inference regardless of whether the facts in the propositional KB were derived from surface anaphora.
Interestingly, the very concepts encoded by criterion failing axioms are themselves of a complex flavor. Indeed, attempting to paraphrase such axioms in English in turn re quires anaphora. The silly rule, for example, comes out as "a hapless (person) is one who owns a (presumed) pet and owns another (presumed) pet that chases the first pet/it/the first one/that first pet/ ... ". One can simply not render this rule in English without resorting to pronouns or the ilk.
It is truly tantalizing that the cases where terminological inference in RHO is computationally hard align with such linguistically hard phenomena as anaphora. Perhaps this alignment may help explain the dearth of intractable terminological axioms in our paper study and in our MUC-5 system. The alignment also suggests that Brachman may have been more right than he thought in the early days of KL-ONE, when he suggested that terminological reasoning was really about the semantics of noun phrases.
Such alignments are also fertile ground for wild specula tion about the nature of language or reasoning. Yielding to cool-headed restraint, though, one may still conclude that useful inference in natural language is less intractable than was previously assumed. And one is no less justified in echoing Alice's ineffable words, "Curiouser and curiouser."

Acknowledgments
Much gratitude is owed John Aberdeen for tireless perusal of the Wall Street Journal. Thanks also to Remko Scha, Bill Woods, Steve Minton, Dennis Connolly, and John Burger.
Appendix A: Proof of tractability
To demonstrate the validity of the tractability criterion, we only need consider the computational cost of finding all instantiations of the right-hand side of an axiom. In general, finding a single such instantiation is NP-complete, by reduction to the conjunctive Boolean query problem [Garey and Johnson, 1979]. Intuitively, this is because general function-free Horn clauses can have arbitrary interactions between the variables on the right-hand side, i.e., their dependency graphs are fully cross-connected, as in:
R(v1.v2) & R(v1.v3) & R(v2,v3) & R(v1,v4) & R(v2,v4) ...
Intuitively again, verifying the instantiation of a given variable in a rule may require (in the worst case) checking all instantiations of all other variables in the rule. Under the usual assumptions of NP-completeness, no known algorithm exists that performs better in the worst case than enumerating all these instantiations. As each variable may take on as many as IC instantiations, where IC is the number of constants present in the knowledge base, the overall cost of finding a single globally consistent instantiation is 0( ,6), where ; is the number of variables in the rule. The resulting complexity is thus exponential in g, which itself varies in the worst case with the length of the rule.
Consider now an axiom that satisfies the tractability criterion, yielding a graph such as that in Fig. 4. By definition, the root of the graph corresponds to all the variables on the left-hand side, and all other nodes correspond to some variable introduced on the right-hand side. The cost of finding all the instantiations of the root variables is bounded by ~. where a is the maximal predicate valence for all the predicates appearing in the database. The cost of instantiating each non-root variable v is in turn bounded by ax:<X, corresponding to the cost of enumerating all possible instantiations of any predicate relating v to its single parent in the graph.
The topological restriction of the criterion leads directly to the fact that the exponent of these terms is a low-magnitude constant, a, rather than a parameter, ;, that can be allowed to grow arbitrarily with the complexity of inference rules. The topological restriction also leads to the fact that these terms contribute additively to the overall cost of finding all instantiations of a rule. This overall cost is thus bounded by /(a+ aiCa+ ... +aiCa' or oc;a~). '------v----'
Finally, note that with the appropriate indexing scheme, finding all consequents of all rules only adds a multiplica tive cost of p, where p is the total number of rules, yielding a final overall cost of O(p;a~. It is often assumed that predicates in natural languages have no more than three arguments, so this formula approximately reduces to 0(~).
@inproceedings{ijcai1995p173,
title = {Semantic Inference in Natural Language: Validating a Tractable Approach},
author = {Vilain, Marc B.},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {1346--1352},
year = {1995},
note = {Natural Language},
url = {https://ijcai.org/proceedings/1995/173},
}
TY - CPAPER TI - Semantic Inference in Natural Language: Validating a Tractable Approach AU - Vilain, Marc B. T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 1346 EP - 1352 UR - https://ijcai.org/proceedings/1995/173 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: