| 2009 |
|---|
| 24 | EE | Adria Gascón,
Guillem Godoy,
Florent Jacquemard:
Closure of Tree Automata Languages under Innermost Rewriting.
Electr. Notes Theor. Comput. Sci. 237: 23-38 (2009) |
| 2008 |
|---|
| 23 | EE | Guillem Godoy,
Sebastian Maneth,
Sophie Tison:
Classes of Tree Homomorphisms with Decidable Preservation of Regularity.
FoSSaCS 2008: 127-141 |
| 22 | EE | Adria Gascón,
Guillem Godoy,
Manfred Schmidt-Schauß:
Context Matching for Compressed Terms.
LICS 2008: 93-102 |
| 2007 |
|---|
| 21 | EE | Guillem Godoy,
Sophie Tison:
On the Normalization and Unique Normalization Properties of Term Rewrite Systems.
CADE 2007: 247-262 |
| 20 | EE | Guillem Godoy,
Eduard Huntingford:
Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems.
RTA 2007: 184-199 |
| 19 | EE | Guillem Godoy,
Eduard Huntingford,
Ashish Tiwari:
Termination of Rewriting with Right-Flat Rules.
RTA 2007: 200-213 |
| 2005 |
|---|
| 18 | EE | Guillem Godoy,
Ashish Tiwari:
Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules.
CADE 2005: 164-176 |
| 17 | EE | Guillem Godoy,
Ashish Tiwari:
Confluence of Shallow Right-Linear Rewrite Systems.
CSL 2005: 541-556 |
| 16 | EE | Mirtha-Lina Fernández,
Guillem Godoy,
Albert Rubio:
Recursive Path Orderings Can Also Be Incremental.
LPAR 2005: 230-245 |
| 15 | EE | Mirtha-Lina Fernández,
Guillem Godoy,
Albert Rubio:
Orderings for Innermost Termination.
RTA 2005: 17-31 |
| 2004 |
|---|
| 14 | EE | Guillem Godoy,
Ashish Tiwari:
Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure.
IJCAR 2004: 91-106 |
| 13 | EE | Guillem Godoy,
Robert Nieuwenhuis,
Ashish Tiwari:
Classes of term rewrite systems with polynomial confluence problems.
ACM Trans. Comput. Log. 5(2): 321-331 (2004) |
| 12 | EE | Guillem Godoy,
Ashish Tiwari,
Rakesh M. Verma:
Deciding confluence of certain term rewriting systems in polynomial time.
Ann. Pure Appl. Logic 130(1-3): 33-59 (2004) |
| 11 | EE | Guillem Godoy,
Ashish Tiwari,
Rakesh M. Verma:
Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems.
Appl. Algebra Eng. Commun. Comput. 15(1): 13-36 (2004) |
| 10 | EE | Guillem Godoy,
Robert Nieuwenhuis:
Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups.
Constraints 9(3): 167-192 (2004) |
| 9 | EE | Guillem Godoy,
Robert Nieuwenhuis:
Superposition with completely built-in Abelian groups.
J. Symb. Comput. 37(1): 1-33 (2004) |
| 2003 |
|---|
| 8 | EE | Guillem Godoy,
Ashish Tiwari,
Rakesh M. Verma:
On the Confluence of Linear Shallow Term Rewrite Systems.
STACS 2003: 85-96 |
| 7 | | Miquel Bofill,
Guillem Godoy,
Robert Nieuwenhuis,
Albert Rubio:
Paramodulation and Knuth-Bendix Completion with Nontotal and Nonmonotonic Orderings.
J. Autom. Reasoning 30(1): 99-120 (2003) |
| 2001 |
|---|
| 6 | | Hubert Comon,
Guillem Godoy,
Robert Nieuwenhuis:
The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time.
FOCS 2001: 298-307 |
| 5 | EE | Miquel Bofill,
Guillem Godoy:
On the Completeness of Arbitrary Selection Strategies for Paramodulation.
ICALP 2001: 951-962 |
| 4 | | Guillem Godoy,
Robert Nieuwenhuis:
On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups.
LICS 2001: 38-50 |
| 2000 |
|---|
| 3 | | Miquel Bofill,
Guillem Godoy,
Robert Nieuwenhuis,
Albert Rubio:
Modular Redundancy for Theorem Proving.
FroCos 2000: 186-199 |
| 2 | EE | Guillem Godoy,
Robert Nieuwenhuis:
Paramodulation with Built-in Abelian Groups.
LICS 2000: 413-424 |
| 1999 |
|---|
| 1 | EE | Miquel Bofill,
Guillem Godoy,
Robert Nieuwenhuis,
Albert Rubio:
Paramodulation with Non-Monotonic Orderings.
LICS 1999: 225-233 |
