This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...
An ongoing debate in text understanding efforts centers on the use of pattern-matching techniques, which some have characterized as "designed to ignore as much text as possib...
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Conceptual Graphs and Formal Concept Analysis have in common basic concerns: the focus on conceptual structures, the use of diagrams for supporting communication, the orientation b...