2017
DOI: 10.48550/arxiv.1705.00907
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Non-linear Associative-Commutative Many-to-One Pattern Matching with Sequence Variables

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…• Associative: By leveraging the associative property, the graph rewriting pass can identify an optimized order of operators execution, and hence replace the expensive combination of operators with a new cheaper one. Figure 2 DNNFusion employs pattern matching [36,37] to recognize rewriting candidates. However, associative and commutative matching is NP-complete [5].…”
Section: Mathematical-property-based Graph Rewritingmentioning
confidence: 99%
“…• Associative: By leveraging the associative property, the graph rewriting pass can identify an optimized order of operators execution, and hence replace the expensive combination of operators with a new cheaper one. Figure 2 DNNFusion employs pattern matching [36,37] to recognize rewriting candidates. However, associative and commutative matching is NP-complete [5].…”
Section: Mathematical-property-based Graph Rewritingmentioning
confidence: 99%
“…In this section, we give a brief overview of the many-to-one matching algorithm used by MatchPy. Full details can be found in the master thesis [Kre17b].…”
Section: Optimizationsmentioning
confidence: 99%

MatchPy: A Pattern Matching Library

Krebber,
Barthels,
Bientinesi
2017
Preprint
Self Cite