On subsumption and semiunification in feature algebras
From MaRDI portal
(Redirected from On subsumption and semiunification in feature algebras)
Recommendations
Cites work
- A theory of type polymorphism in programming
- Feature-constraint logics for unification grammars
- scientific article; zbMATH DE number 4180772 (Why is no real title available?)
- scientific article; zbMATH DE number 4166932 (Why is no real title available?)
- scientific article; zbMATH DE number 4080882 (Why is no real title available?)
- scientific article; zbMATH DE number 42737 (Why is no real title available?)
- scientific article; zbMATH DE number 43017 (Why is no real title available?)
- scientific article; zbMATH DE number 549955 (Why is no real title available?)
- scientific article; zbMATH DE number 3110205 (Why is no real title available?)
- Recursive unsolvability of group theoretic problems
- The implication problem for functional and inclusion dependencies
- The Principal Type-Scheme of an Object in Combinatory Logic
- The undecidability of the semi-unification problem
- The word problem for cancellation semigroups with zero
- Unsolvability of the universal theory of finite groups
Cited in
(5)- Ordering constraints over feature trees expressed in second-order monadic logic.
- Fibred semantics for feature-based grammar logic
- scientific article; zbMATH DE number 4166932 (Why is no real title available?)
- scientific article; zbMATH DE number 67967 (Why is no real title available?)
- scientific article; zbMATH DE number 1952665 (Why is no real title available?)
This page was built for publication: On subsumption and semiunification in feature algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194340)