| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 2 of 2
reviews
|
|
|
 |
|
|
|
|
 On the parameterized complexity of associative and commutative unification
Akutsu T., Jansson J., Takasu A., Tamura T. Theoretical Computer Science 660(C): 57-74, 2017. Type: Article
Equational unification and matching play an important role in theorem proving, term rewriting, and declarative programming. Given a set of axioms and two terms, equational unification asks whether the terms can be made equal by variabl...
|
Jun 28 2018 |
|
|
|
|
|
|
On the parameterized complexity of associative and commutative unification
Akutsu T., Jansson J., Takasu A., Tamura T. Theoretical Computer Science 660(C): 57-74, 2017. Type: Article
Equational unification and matching play an important role in theorem proving, term rewriting, and declarative programming. Given a set of axioms and two terms, equational unification asks whether the terms can be made equal by variabl...
|
Jun 28 2018 |
|
|
|
|
|
| |
|
|
| |
|
|
