On the Complexity of Deduction Modulo Leaf Permutative Equations

Thierry Boy de la Tour, Mnacho Echenim. On the Complexity of Deduction Modulo Leaf Permutative Equations. Journal of Automated Reasoning, 33(3-4):271-317, 2004. [doi]

@article{TourE04:0,
  title = {On the Complexity of Deduction Modulo Leaf Permutative Equations},
  author = {Thierry Boy de la Tour and Mnacho Echenim},
  year = {2004},
  url = {http://www.springerlink.com/index/10.1007/s10817-004-6244-2},
  researchr = {https://researchr.org/publication/TourE04%3A0},
  cites = {0},
  citedby = {0},
  journal = {Journal of Automated Reasoning},
  volume = {33},
  number = {3-4},
  pages = {271-317},
}