On the complexity of deduction modulo leaf permutative equations

DOI10.1007/s10817-004-6244-2zbMath1086.03008OpenAlexW2020743356MaRDI QIDQ556681

Mnacho Echenim, Thierry Boy de la Tour

Publication date: 22 June 2005

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-004-6244-2

zbMATH Keywords

automated deductionleaf permutative equationsstratified terms

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutation group algorithms based on partitions. I: Theory and algorithms
• Fundamental algorithms for permutation groups
• LEAN: An intermediate language based on graph rewriting
• Random Graph Isomorphism
• A Unification Algorithm for Associative-Commutative Functions
• Term Rewriting and All That
• On leaf permutative theories and occurrence permutation groups
• Automated Reasoning
• General algorithms for permutations in equational inference

This page was built for publication: On the complexity of deduction modulo leaf permutative equations