B Nebel - Artificial Intelligence, 1990 - Elsevier
Computational tractability has been a major concern in the area of terminological knowledge representation and reasoning. However, all analyses of the computational complexity of …
G Smolka - The Journal of Logic Programming, 1992 - Elsevier
This paper studies feature-description languages that have been developed for use in unification grammars, logic programming, and knowledge representation. The distinctive …
The virtues of viewing the lexicon as an inheritance network are its succinctness and its tendency to highlight significant clusters of linguistic properties. From its succinctness follow …
Inheritance is an inference mechanism originally defined for semantic network formalisms. It allows redundancy to be removed from the description of a domain by factoring out reusable …
JT Maxwell III, RM Kaplan - US Patent 5,819,210, 1998 - Google Patents
A method of unifying edge data structures using a processor. The method begins with creation of a first edge data structure and unifying it with a second edge data structure. If …
J Dorre, A Eisele - COLING 1990 Volume 2: Papers presented to …, 1990 - aclanthology.org
Abstract\Ve introduce lea. tare terms containing sorts, vztriables, negation and named disjunction for the specification of feature structures. We show that the possibility to label …
The author proposes the Theory of Connected Word Constructions (TCWC), a generative theory of morphology, focusing on phonic, rather than semantic, structure. It is unique by its …
Morphotactics and allomorphy are usually modeled in different components, leading to interface problems. To describe both uniformly, we define finite automate (FA) for allomorphy …