Computational Complexity of Simultaneous Elementary Matching Problems

  • Authors:

  • Miki Hermann;Phokion G. Kolaitis

  • Affiliations:

  • LORIA (CNRS), BP 239, 54506 Vandœuvre-lès-Nancy, France. e-mail: hermann@loria.fr;Computer Science Department, University of California, Santa Cruz, CA 95064, U.S.A. e-mail: kolaitis@cse.ucsc.edu

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

The simultaneous elementary E-matching problem for an equational theory E is to decide whether there is an E-matcher for a given system of equations in which the only nonconstant function symbols occurring in the terms to be matched are the ones constrained by the equational axioms of E. We study the computational complexity of simultaneous elementary matching problems for the equational theories A of semigroups, AC of commutative semigroups, and ACU of commutative monoids. In each case, we delineate the boundary between NP-completeness and solvability in polynomial time by considering two parameters, the number of equations in the systems and the number of constant symbols in the signature. Moreover, we analyze further the intractable cases of simultaneous elementary AC-matching and ACU-matching by also taking into account the maximum number of occurrences of each variable. Using combinatorial optimization techniques, we show that if each variable is restricted to having at most two occurrences, then several cases of simultaneous elementary AC-matching and ACU-matching can be solved in polynomial time.