Average-case analysis of unification algorithms

DOI10.1016/0304-3975(93)90208-BzbMath0779.68043MaRDI QIDQ685442

Rafael Casas, François Fages, Luc Albert

Publication date: 23 January 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

average-case complexityoccur checkrandom pairs of treesunifiable pairs of treeunification algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Logic programming (68N17)

Related Items (2)

Scheduling complexity of interleaving search ⋮ The fuzzy logic programming language FASILL: design and implementation

Uses Software

• Maple

Cites Work

• Fundamental properties of infinite trees
• Combinatorial aspects of continued fractions
• Complexity of the unification algorithm for first-order expressions
• Linear unification
• Complete sets of transformations for general E-unification
• Average-case analysis of Robinson's unification algorithm with two different variables
• Singularity Analysis of Generating Functions
• On the sequential nature of unification
• An Efficient Unification Algorithm
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Average-case analysis of unification algorithms