5 research outputs found
The ISCIP Analyst, Volume VIII, Issue 1
This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy
The ISCIP Analyst, Volume VIII, Issue 4
This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy
The ISCIP Analyst, Volume VII, Issue 20
This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy
Inhibition of Voltage-Gated Hv1 Channel by Guanidine Derivatives
This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy
On subsumption and semiunification in feature algebras
AbstractWe consider a generalization of term subsumption, or matching, to a class of mathematical structures which we call feature algebras. We show how these generalize both first-order terms and the feature structures used in computational linguistics. The notion of term subsumption generalizes to a natural notion of algebra homomorphism. In the setting of feature algebras, unification, corresponds naturally to solving constraints involving equalities between strings of unary function symbols, and semiunification also allows inequalities representing subsumption constraints. Our generalization allows us to show that the semiunification problem for finite feature algebras is undecidable. This implies that the corresponding problem for rational trees (cyclic terms) is also undecidable