Papers.

Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire

Correcting a widespread error in unification algorithms

Abstract The unification of two patterns both containing variables is a ubiquitous operation in logic programming and in many artificial intelligence applications. Thus, many texts present unification algorithms. Unfortunately, at least seven of these presentations are incorrect. The common error occurs when logic variables are represented as binding lists; implementations that destructively update variable cells do not manifest the error. This note gives the examples that uncover the error and presents a correction.

The Physician's Information Assistant

The Ames-Lockheed orbiter processing scheduling system

Techniques for Automatic Memoization with Applications to Context-Free Parsing

It is shown that a process similar to Earley's algorithm can be generated by a simple top-down backtracking parser, when augmented by automatic memoization. The memoized parser has the same complexity as Earley's algorithm, but parses constituents in a different order. Techniques for deriving memo functions are described, with a complete implementation in Common Lisp, and an outline of a macro-based approach for other languages.

Space Shuttle processing - A case study in artificial intelligence

SESSION 1: SPEECH AND NATURAL LANGUAGE EFFORTS IN THE U. S. AND ABROAD

Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp

Paradigms of AI Programming is the first text to teach advanced Common Lisp techniques in the context of building major AI systems. By reconstructing authentic, complex AI programs using state-of-the-art Common Lisp, the book teaches students and professionals how to build and debug robust practical programs, while demonstrating superior programming style and important AI concepts. The author strongly emphasizes the practical performance issues involved in writing real working programs of significant size. Chapters on troubleshooting and efficiency are included, along with a discussion of th

Paper Session II-B - Space Shuttle Processing: A Case Study in Artificial Intelligence

Iterative repair for scheduling and rescheduling

Handbook of algorithms and data structures: in Pascal and C (2nd ed.)

Handbook of algorithms and data structures : in Pascal and C

From meaning to term: semantic locality in the UMLS Metathesaurus

Constraint-based scheduling

Biomedical database inter-connectivity: an experiment linking MIM, GENBANK, and META-1 via MEDLINE

Association for Computational Linguistics Data Collection Inititative

Adding your terms and relationships to the UMLS Metathesaurus

A procedure for quantitatively comparing the syntactic coverage of English

Analysis of Boyer-Moore-type string searching algorithms

Large springs in the Valley and Ridge Province in Tennessee

A finite-state morphological processor for Spanish

A Critical Evaluation of Commensurable Abduction Models for Semantic Interpretation

Language interpretation involves mapping from a string of words to a representation of an interpretation of those words. The problem is to be able to combine evidence I'rom the lexicon, syntax, semantics, ,'rod pragmatics to arrive at the best of the many possible interpretations. Given the well-worn sentence "The box is in the pen," ~;yntax may say that "pen '~ is a noun, while lexical knowledge may say that "pen" most often means writing implement, less often means a fenced enclosure, and very rarely means a female swan. Semantics may say that the object of "in" is often an enclosure, and pragmatics may ::ay lhat the topic is hiding small boxes of illegal drugs im side aquatic birds, Thus there is evidence for.multiple intc.rpretations, and one needs some way to decide between them. In the past few years, some general approaches to interpretation have been advanced within an abduction framework. Charniak (1986) and Norvig (1987, 1989) m'e two examples. Abduction is a term coined by Pierce (1955) to describe the (unsound) inference rule that concludes A from the observation 13 and the role A ~ B, along with the fact that there is no "better" rule explaining B. In this paper we critically evaluate three recent alxluctire interpretation models, those of Chamiak and Goldman (1989); Hobbs, Stickel, Martin and Edwards (1988); a~(1 Ng and Mooney (1990). "Itmse three models add the important property of commensurability: all types of evidence are represented in a common currency that can be compared and combined. While commensurability is a desirable property, and there is a clear need for a way to compare alternate explanations, it appears that a single scalar measure is not enough to account for all types of processing. We present other problems for the abductive approach, and some tentative solutions.

Peak-Load Pricing in Postal Services

Optimizations for Dynamic Inverted Index Maintenance

Compiler design for sets in Pascal

The shape of a spoken phrase

A dynamic storage allocation algorithm suitable for file structures

An analysis of the Karp-Rabin string matching algorithm

Average case analysis of algorithms using matrix recurrences

Expected behaviour analysis of AVL trees

Fast algorithms for two dimensional and multiple pattern matching

Using Meta-1-The 1st Version of the UMLS Metathesaurus

The 1990 progress report and future plans

Scientific Demonstration Abstracts. Demonstration Abstracts: Tools for Medical Database Construction, Access, and Delivery: m-CD™: A hyperCard Interface to Meta-1 on a CD-Rom

Learning search control for constraint-based scheduling

Fast algorithms for two-dimensional and multiple pattern matching (preliminary version)

Editing the UMLS Metathesaurus: Review and Enhancement of a Computed Knowledge Source

Drug and Chemical Entries in Meta-1

Concepts, Issues, and Standards. Current Status of the NLM's Umls Project: Using Meta-1-The 1st Version of the UMLS Metathesaurus

Concepts, Issues, and Standards. Applications Using the Unified Medical Language System: A Preliminary Evaluation of the UMLS Metathesaurus for Patient Record Classification

An adaptive overflow technique for B-trees (extended abstract)

A Preliminary Evaluation of the UMLS Metathesaurus for Patient Record Classification

Text on tap

Conservation of design knowledge

Marker Passing as a Weak Method for Text Inferencing

The problem of deciding what is implied by a written text, of “reading between the lines” is the problem of text inference. To extract proper inferences from a text requires a great deal of general knowledge on the part of the reader. Past approaches have often used a “strong method” tuned to process a particular kind of knowledge structure (such as a script, or a plan). The alternative is a “weak method” which is applicable to a variety of knowledge structures. Just such a method is proposed here, one which recognizes six very general classes of inference. These classes are not dependent on individual knowledge structures, but instead rely on patterns of connectivity between concepts. Patterns are discovered, and inferences are suggested, by a process of marker passing between concepts.

The new COBOL standard

A new approach to text searching

A new approach to text searching

Algorithms for string searching

Performance of B/sup +/-trees with partial expansions