On subsumption and semiunification in feature algebras

DOI10.1016/S0747-7171(08)80107-1zbMath0780.68073OpenAlexW2104295731MaRDI QIDQ1194340

William C. Rounds, Jochen Dörre

Publication date: 27 September 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80107-1

zbMATH Keywords

unificationalgebra homomorphismfeature algebrasgeneralization of term subsumptionsemiunification

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (2)

Fibred semantics for feature-based grammar logic ⋮ Ordering constraints over feature trees expressed in second-order monadic logic.

Uses Software

• ML

Cites Work

• Recursive unsolvability of group theoretic problems
• Unsolvability of the universal theory of finite groups
• The undecidability of the semi-unification problem
• A theory of type polymorphism in programming
• The implication problem for functional and inclusion dependencies
• The word problem for cancellation semigroups with zero
• Feature-constraint logics for unification grammars
• The Principal Type-Scheme of an Object in Combinatory Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On subsumption and semiunification in feature algebras