On the complexity of deduction modulo leaf permutative equations
From MaRDI portal
Publication:556681
DOI10.1007/s10817-004-6244-2zbMath1086.03008MaRDI QIDQ556681
Thierry Boy de la Tour, Mnacho Echenim
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
03B35: Mechanization of proofs and logical operations
03D15: Complexity of computation (including implicit computational complexity)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
03F20: Complexity of proofs
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