Matching Modulo Associativity and Idempotency Is NP-Complete

Authors:
Ondrej Klíma;Jirí Srba
Affiliations:
-;-
Venue:
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Year:
2000

Citing 8
Cited 1

NP-completeness of the set unification and matching problems

Proc. of the 8th international conference on Automated deduction
Unification under associativity and idempotence is of type nullary

Journal of Automated Reasoning
The theory of idempotent semigroups is of unification type zero

Journal of Automated Reasoning
String-rewriting systems

String-rewriting systems
Unification theory

Handbook of logic in artificial intelligence and logic programming
Unification in the union of disjoint equational theories: combining decision procedures

Journal of Symbolic Computation
Makanin's Algorithm for Word Equations - Two Improvements and a Generalization

IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
Pattern Equations and Equations with Stuttering

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics

Unification Modulo Associativity and Idempotency Is NP-complete

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that AI-matching (AI denotes the theory of an associative and idempotent function symbol), which is solving matching word equations in free idempotent semigroups, is NP-complete. Note: full version of the paper appears as [8].