| 2008 |
|---|
| 12 | EE | Thierry Boy de la Tour,
Mnacho Echenim,
Paliath Narendran:
Unification and Matching Modulo Leaf-Permutative Equational Presentations.
IJCAR 2008: 332-347 |
| 11 | EE | Maria Paola Bonacina,
Mnacho Echenim:
On Variable-inactivity and Polynomial tau-Satisfiability Procedures.
J. Log. Comput. 18(1): 77-96 (2008) |
| 2007 |
|---|
| 10 | EE | Maria Paola Bonacina,
Mnacho Echenim:
T-Decision by Decomposition.
CADE 2007: 199-214 |
| 9 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
Determining Unify-Stable Presentations.
RTA 2007: 63-77 |
| 8 | EE | Maria Paola Bonacina,
Mnacho Echenim:
Rewrite-Based Decision Procedures.
Electr. Notes Theor. Comput. Sci. 174(11): 27-45 (2007) |
| 7 | EE | Maria Paola Bonacina,
Mnacho Echenim:
Rewrite-Based Satisfiability Procedures for Recursive Data Structures.
Electr. Notes Theor. Comput. Sci. 174(8): 55-70 (2007) |
| 6 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
Permutative rewriting and unification.
Inf. Comput. 205(4): 624-650 (2007) |
| 2005 |
|---|
| 5 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
Unification in a Class of Permutative Theories.
RTA 2005: 105-119 |
| 2004 |
|---|
| 4 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
Overlapping Leaf Permutative Equations.
IJCAR 2004: 430-444 |
| 3 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
On the Complexity of Deduction Modulo Leaf Permutative Equations.
J. Autom. Reasoning 33(3-4): 271-317 (2004) |
| 2003 |
|---|
| 2 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
NP-Completeness Results for Deductive Problems on Stratified Terms.
LPAR 2003: 317-331 |
| 1 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
On Leaf Permutative Theories and Occurrence Permutation Groups.
Electr. Notes Theor. Comput. Sci. 86(1): (2003) |
