General algorithms for permutations in equational inference

DOI10.1023/A:1006439522342MaRDI QIDQ5931113zbMATH OpenOpenAlexFDO

Authors Jürgen Avenhaus, David A. Plaisted

Publication date 21 May 2002

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

Full work available at URL https://doi.org/10.1023/a:1006439522342

zbMATH Keywords

permutationspermutation groupsequational reasoningterm-rewriting systemsequational inference

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Grammars and rewriting systems (68Q42) Mechanization of proofs and logical operations (03B35)

Recommendations

• Automated Reasoning
• Negation elimination in empty or permutative theories
• On leaf permutative theories and occurrence permutation groups
• Automated Reasoning
• Permutative rewriting and unification

Cited in

(7)

• On leaf permutative theories and occurrence permutation groups
• On the complexity of deduction modulo leaf permutative equations
• Modeling Permutations in Coq for Coccinelle
• Uniform rewriting based on permutations
• Automated Reasoning
• Automated Reasoning
• Permutation dependency in datalog programs

This page was built for publication: General algorithms for permutations in equational inference

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