Paramodulation with Non-Monotonic Orderings. - Miquel Bofill; Guillem Godoy; Robert Nieuwenhuis; Albert Rubio (LICS, 1999)

Modular Redundancy for Theorem Proving. - Miquel Bofill; Guillem Godoy; Robert Nieuwenhuis; Albert Rubio (FroCoS, 2000)

Paramodulation with Built-in Abelian Groups. - Guillem Godoy; Robert Nieuwenhuis (LICS, 2000)

The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. - Hubert Comon; Guillem Godoy; Robert Nieuwenhuis (FOCS, 2001)

On the Completeness of Arbitrary Selection Strategies for Paramodulation. - Miquel Bofill; Guillem Godoy (ICALP, 2001)

On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups. - Guillem Godoy; Robert Nieuwenhuis (LICS, 2001)

Automated deduction with built-in theories: completeness results and constraint solving techniques. - Guillem Godoy (2001)

On the Confluence of Linear Shallow Term Rewrite Systems. - Guillem Godoy; Ashish Tiwari 001; Rakesh M. Verma (STACS, 2003)

Paramodulation and Knuth-Bendix Completion with Nontotal and Nonmonotonic Orderings. - Miquel Bofill; Guillem Godoy; Robert Nieuwenhuis; Albert Rubio (J. Autom. Reason., 2003)

Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure. - Guillem Godoy; Ashish Tiwari 001 (IJCAR, 2004)

Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems. - Guillem Godoy; Ashish Tiwari 001; Rakesh M. Verma (Appl. Algebra Eng. Commun. Comput., 2004)

Deciding confluence of certain term rewriting systems in polynomial time. - Guillem Godoy; Ashish Tiwari 001; Rakesh M. Verma (Ann. Pure Appl. Log., 2004)

Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups. - Guillem Godoy; Robert Nieuwenhuis (Constraints An Int. J., 2004)

Superposition with completely built-in Abelian groups. - Guillem Godoy; Robert Nieuwenhuis (J. Symb. Comput., 2004)

Classes of term rewrite systems with polynomial confluence problems. - Guillem Godoy; Robert Nieuwenhuis; Ashish Tiwari 001 (ACM Trans. Comput. Log., 2004)

Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules. - Guillem Godoy; Ashish Tiwari 001 (CADE, 2005)

Confluence of Shallow Right-Linear Rewrite Systems. - Guillem Godoy; Ashish Tiwari 001 (CSL, 2005)

Recursive Path Orderings Can Also Be Incremental. - Mirtha-Lina Fernández; Guillem Godoy; Albert Rubio (LPAR, 2005)

Orderings for Innermost Termination. - Mirtha-Lina Fernández; Guillem Godoy; Albert Rubio (RTA, 2005)

On the Normalization and Unique Normalization Properties of Term Rewrite Systems. - Guillem Godoy; Sophie Tison (CADE, 2007)

Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems. - Guillem Godoy; Eduard Huntingford (RTA, 2007)

Termination of Rewriting with Right-Flat Rules. - Guillem Godoy; Eduard Huntingford; Ashish Tiwari 001 (RTA, 2007)

Classes of Tree Homomorphisms with Decidable Preservation of Regularity. - Guillem Godoy; Sebastian Maneth; Sophie Tison (FoSSaCS, 2008)

Context Matching for Compressed Terms. - Adrià Gascón; Guillem Godoy; Manfred Schmidt-Schauß (LICS, 2008)

Closure of Tree Automata Languages under Innermost Rewriting. - Adrià Gascón; Guillem Godoy; Florent Jacquemard (WRS@RTA, 2008)

Unification with Singleton Tree Grammars. - Adrià Gascón; Guillem Godoy; Manfred Schmidt-Schauß (RTA, 2009)

Unique Normalization for Shallow TRS. - Guillem Godoy; Florent Jacquemard (RTA, 2009)

Invariant Checking for Programs with Procedure Calls. - Guillem Godoy; Ashish Tiwari 001 (SAS, 2009)

Undecidable properties of flat term rewrite systems. - Guillem Godoy; Hugo Hernández (Appl. Algebra Eng. Commun. Comput., 2009)

The Emptiness Problem for Tree Automata with Global Constraints. - Luis Barguñó; Carles Creus; Guillem Godoy; Florent Jacquemard; Camille Vacher (LICS, 2010)

The HOM problem is decidable. - Guillem Godoy; Omer Giménez; Lander Ramos; Carme Àlvarez (STOC, 2010)

Normalization properties for Shallow TRS and Innermost Rewriting. - Guillem Godoy (Appl. Algebra Eng. Commun. Comput., 2010)

Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories - Luis Barguñó; Guillem Godoy; Eduard Huntingford; Ashish Tiwari 001 (Log. Methods Comput. Sci., 2010)

Context unification with one context variable. - Adrià Gascón; Guillem Godoy; Manfred Schmidt-Schauß; Ashish Tiwari 001 (J. Symb. Comput., 2010)

Learning Theory through Videos - A Teaching Experience in a Theoretical Course based on Self-learning Videos and Problem-solving Sessions. - Marta Arias; Carles Creus; Adrià Gascón; Guillem Godoy (CSEDU (2), 2011)

Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete. - Omer Giménez; Guillem Godoy; Sebastian Maneth (SIAM J. Comput., 2011)

Unification and matching on compressed terms. - Adrià Gascón; Guillem Godoy; Manfred Schmidt-Schauß (ACM Trans. Comput. Log., 2011)

One-context Unification with STG-Compressed Terms is in NP. - Carles Creus; Adrià Gascón; Guillem Godoy (RTA, 2012)

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories - Luis Barguñó; Carles Creus; Guillem Godoy; Florent Jacquemard; Camille Vacher (Log. Methods Comput. Sci., 2013)

The HOM problem is decidable. - Guillem Godoy; Omer Giménez (J. ACM, 2013)

Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints. - Carles Creus; Adrià Gascón; Guillem Godoy (J. Autom. Reason., 2013)

Non-Linear Rewrite Closure and Weak Normalization. - Carles Creus; Guillem Godoy; Francesc Massanes; Ashish Tiwari 001 (J. Autom. Reason., 2013)

Automatic Evaluation of Context-Free Grammars (System Description). - Carles Creus; Guillem Godoy (RTA-TLCA, 2014)

Tree Automata with Height Constraints between Brothers. - Carles Creus; Guillem Godoy (RTA-TLCA, 2014)

Automatic Evaluation of Reductions between NP-Complete Problems. - Carles Creus; Pau Fernández; Guillem Godoy (SAT, 2014)

Excessively duplicating patterns represent non-regular languages. - Carles Creus; Guillem Godoy; Lander Ramos (Inf. Process. Lett., 2014)

The HOM Problem is EXPTIME-Complete. - Carles Creus; Adrià Gascón; Guillem Godoy; Lander Ramos (SIAM J. Comput., 2016)

Exploring the landscape of learning analytics privacy in fog and edge computing: A systematic literature review. - Daniel Amo Filvà; David Fonseca 001; Francisco José García-Peñalvo; Marc Alier Forment; María José Casany Guerrero; Guillem Godoy (Comput. Hum. Behav., 2024)