MatchPy: A Pattern Matching Library

Pattern matching is a powerful tool for symbolic computations, based on the well-defined theory of term rewriting systems. Application domains include algebraic expressions, abstract syntax trees, and XML and JSON data. Unfortunately, no lightweight implementation of pattern matching as general and flexible as Mathematica exists for Python Mathics,MacroPy,patterns,PyPatt. Therefore, we created the open source module MatchPy which offers similar pattern matching functionality in Python using a novel algorithm which finds matches for large pattern sets more efficiently by exploiting similarities between patterns.Comment: arXiv admin note: substantial text overlap with arXiv:1710.0007

Tree Automata Help One To Solve Equational Formulae In AC-Theories

this paper we consider particular equational formulae where equality =AC is the congruence induced by a set of associative-commutative axioms. The formulae we are interested in have the form t 6= AC t 1 : : : t 6= AC t n and are usually known as complement problems. To solve a complement problem is to find an instance of t which is not an instance of any t i modulo associativity-commutativity. We give a decision procedure based on tree automata which solves these formulae when all the t

Tree automata help one to solve equational formulae in AC-theories

Programme 2 : calcul symbolique, programmation et genie logicielSIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1993 n.2029 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc