Fast algorithms for uniform semi-unification
From MaRDI portal
Publication:2643520
Recommendations
Cites work
- An almost linear Robinson unification algorithm
- Fast algorithms for uniform semi-unification
- scientific article; zbMATH DE number 4035120 (Why is no real title available?)
- scientific article; zbMATH DE number 4085639 (Why is no real title available?)
- scientific article; zbMATH DE number 4092757 (Why is no real title available?)
- scientific article; zbMATH DE number 8327 (Why is no real title available?)
- scientific article; zbMATH DE number 176162 (Why is no real title available?)
- scientific article; zbMATH DE number 3481857 (Why is no real title available?)
- The undecidability of the semi-unification problem
- Unification theory
Cited in
(18)- A practically efficient and almost linear unification algorithm
- Average-case analysis of Robinson's unification algorithm with two different variables
- Source-tracking unification
- Fast algorithms for uniform semi-unification
- Unification modulo nonnested recursion schemes via anchored semi-unification
- scientific article; zbMATH DE number 440473 (Why is no real title available?)
- Une charpente de semi-unification
- scientific article; zbMATH DE number 4092757 (Why is no real title available?)
- scientific article; zbMATH DE number 88941 (Why is no real title available?)
- scientific article; zbMATH DE number 176162 (Why is no real title available?)
- scientific article; zbMATH DE number 176505 (Why is no real title available?)
- Efficient general AGH-unification
- Termination of rule-based calculi for uniform semi-unification
- Fast Evaluation of Union-Intersection Expressions
- Best unifiers in transitive modal logics
- Average-case analysis of unification algorithms
- Unification in linear temporal logic LTL
- Semi-unification
This page was built for publication: Fast algorithms for uniform semi-unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643520)