Combining unification algorithms

DOI10.1006/JSCO.1993.1066MaRDI QIDQ1329186zbMATH OpenOpenAlexFDO

Authors Alexandre Boudet

Publication date 18 October 1995

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

Full work available at URL https://doi.org/10.1006/jsco.1993.1066

zbMATH Keywords

unification algorithms

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Symbolic computation and algebraic computation (68W30)

Recommendations

• Unification in a combination of equational theories: an efficient algorithm
• scientific article; zbMATH DE number 4049130
• scientific article; zbMATH DE number 4112560
• scientific article; zbMATH DE number 1346495
• scientific article; zbMATH DE number 1552528

Cited in

(43)

• Combination of convex theories: modularity, deduction completeness, and explanation
• Unification in combinations of collapse-free regular theories
• A practically efficient and almost linear unification algorithm
• Combination of constraint solvers for free and quasi-free structures
• Completion for unification
• Combining matching algorithms: The regular case
• Unification with extended patterns
• Unions of non-disjoint theories and combinations of satisfiability procedures
• Unification algorithms cannot be combined in polynomial time.
• Rule-based unification in combined theories and the finite variant property
• scientific article; zbMATH DE number 1722699 (Why is no real title available?)
• Unification and matching in hierarchical combinations of syntactic theories
• Complexity of linear standard theories
• scientific article; zbMATH DE number 2089363 (Why is no real title available?)
• scientific article; zbMATH DE number 3866609 (Why is no real title available?)
• scientific article; zbMATH DE number 3871334 (Why is no real title available?)
• Solution of systems of equations in the first-order Shostak theories
• Solutions of functional equations in Shostak theories
• Rewriting modulo SMT and open system analysis
• Combining equational reasoning
• scientific article; zbMATH DE number 3945372 (Why is no real title available?)
• scientific article; zbMATH DE number 3952479 (Why is no real title available?)
• scientific article; zbMATH DE number 3957052 (Why is no real title available?)
• scientific article; zbMATH DE number 4047179 (Why is no real title available?)
• scientific article; zbMATH DE number 4049130 (Why is no real title available?)
• scientific article; zbMATH DE number 4080961 (Why is no real title available?)
• scientific article; zbMATH DE number 4092822 (Why is no real title available?)
• scientific article; zbMATH DE number 4112560 (Why is no real title available?)
• scientific article; zbMATH DE number 1346494 (Why is no real title available?)
• scientific article; zbMATH DE number 1346495 (Why is no real title available?)
• scientific article; zbMATH DE number 1552528 (Why is no real title available?)
• Prototyping combination of unification algorithms with the \(\mathsf{ELAN}\) rule-based programming language
• Unification algorithms cannot be combined in polynomial time
• Variant-Based Satisfiability in Initial Algebras
• Combining matching algorithms: The regular case
• Combination techniques and decision problems for disunification
• Combination of constraint solving techniques: An algebraic point of view
• AC-complete unification and its application to theorem proving
• An algorithm for the unification of fusion theories (UFT)
• Unification Modulo Builtins
• Variants and satisfiability in the infinitary unification wonderland
• Average-case analysis of unification algorithms
• A practical unification algorithm

This page was built for publication: Combining unification algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329186)