Guillem Godoy

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 2

Top Topics

Grammatical Inference

Regular Languages

Automatic Evaluation

Top Venues

Inf. Process. Lett.

Comput. Hum. Behav.

Publications

Daniel Amo Filvà, David Fonseca, Francisco José García-Peñalvo, Marc Alier Forment, María José Casany Guerrero, Guillem Godoy
Exploring the landscape of learning analytics privacy in fog and edge computing: A systematic literature review. Comput. Hum. Behav. 158 (2024)
Carles Creus, Adrià Gascón, Guillem Godoy, Lander Ramos
The HOM Problem is EXPTIME-Complete. SIAM J. Comput. 45 (4) (2016)
Carles Creus, Guillem Godoy, Lander Ramos
Excessively duplicating patterns represent non-regular languages. Inf. Process. Lett. 114 (3) (2014)
Carles Creus, Pau Fernández, Guillem Godoy
Automatic Evaluation of Reductions between NP-Complete Problems. SAT (2014)
Carles Creus, Guillem Godoy
Tree Automata with Height Constraints between Brothers. RTA-TLCA (2014)
Carles Creus, Guillem Godoy
Automatic Evaluation of Context-Free Grammars (System Description). RTA-TLCA (2014)
Carles Creus, Guillem Godoy, Francesc Massanes, Ashish Tiwari
Non-Linear Rewrite Closure and Weak Normalization. J. Autom. Reason. 51 (3) (2013)
Guillem Godoy, Omer Giménez
The HOM problem is decidable. J. ACM 60 (4) (2013)
Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories Log. Methods Comput. Sci. 9 (2) (2013)
Carles Creus, Adrià Gascón, Guillem Godoy
Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints. J. Autom. Reason. 51 (4) (2013)
Carles Creus, Adrià Gascón, Guillem Godoy
One-context Unification with STG-Compressed Terms is in NP. RTA (2012)
Carles Creus, Adrià Gascón, Guillem Godoy, Lander Ramos
The HOM Problem is EXPTIME-Complete. LICS (2012)
Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
Unification and matching on compressed terms. ACM Trans. Comput. Log. 12 (4) (2011)
Marta Arias, Carles Creus, Adrià Gascón, Guillem Godoy
Learning Theory through Videos - A Teaching Experience in a Theoretical Course based on Self-learning Videos and Problem-solving Sessions. CSEDU (2) (2011)
Omer Giménez, Guillem Godoy, Sebastian Maneth
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete. SIAM J. Comput. 40 (2) (2011)
Guillem Godoy
Normalization properties for Shallow TRS and Innermost Rewriting. Appl. Algebra Eng. Commun. Comput. 21 (2) (2010)
Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß, Ashish Tiwari
Context unification with one context variable. J. Symb. Comput. 45 (2) (2010)
Luis Barguñó, Guillem Godoy, Eduard Huntingford, Ashish Tiwari
Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories Log. Methods Comput. Sci. 6 (3) (2010)
Guillem Godoy, Omer Giménez, Lander Ramos, Carme Àlvarez
The HOM problem is decidable. STOC (2010)
Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher
The Emptiness Problem for Tree Automata with Global Constraints. LICS (2010)
Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
Unification and Matching on Compressed Terms CoRR (2010)
Guillem Godoy, Ashish Tiwari
Invariant Checking for Programs with Procedure Calls. SAS (2009)
Adrià Gascón, Guillem Godoy, Florent Jacquemard
Closure of Tree Automata Languages under Innermost Rewriting. Electron. Notes Theor. Comput. Sci. 237 (2009)
Guillem Godoy, Hugo Hernández
Undecidable properties of flat term rewrite systems. Appl. Algebra Eng. Commun. Comput. 20 (2) (2009)
Guillem Godoy, Florent Jacquemard
Unique Normalization for Shallow TRS. RTA (2009)
Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
Unification with Singleton Tree Grammars. RTA (2009)
Carles Creus, Guillem Godoy, Francesc Massanes, Ashish Tiwari
Non-linear Rewrite Closure and Weak Normalization. LICS (2009)
Omer Giménez, Guillem Godoy, Sebastian Maneth
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete CoRR (2009)
Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
Context Matching for Compressed Terms. LICS (2008)
Guillem Godoy, Sebastian Maneth, Sophie Tison
Classes of Tree Homomorphisms with Decidable Preservation of Regularity. FoSSaCS (2008)
Guillem Godoy, Eduard Huntingford, Ashish Tiwari
Termination of Rewriting with Right-Flat Rules. RTA (2007)
Guillem Godoy, Eduard Huntingford
Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems. RTA (2007)
Guillem Godoy, Sophie Tison
On the Normalization and Unique Normalization Properties of Term Rewrite Systems. CADE (2007)
Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio
Orderings for Innermost Termination. RTA (2005)
Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio
Recursive Path Orderings Can Also Be Incremental. LPAR (2005)
Guillem Godoy, Ashish Tiwari
Confluence of Shallow Right-Linear Rewrite Systems. CSL (2005)
Guillem Godoy, Ashish Tiwari
Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules. CADE (2005)
Guillem Godoy, Robert Nieuwenhuis, Ashish Tiwari
Classes of term rewrite systems with polynomial confluence problems. ACM Trans. Comput. Log. 5 (2) (2004)
Guillem Godoy, Ashish Tiwari
Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure. IJCAR (2004)
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) (2004)
Guillem Godoy, Robert Nieuwenhuis
Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups. Constraints An Int. J. 9 (3) (2004)
Guillem Godoy, Ashish Tiwari, Rakesh M. Verma
Deciding confluence of certain term rewriting systems in polynomial time. Ann. Pure Appl. Log. 130 (1-3) (2004)
Guillem Godoy, Robert Nieuwenhuis
Superposition with completely built-in Abelian groups. J. Symb. Comput. 37 (1) (2004)
Guillem Godoy, Ashish Tiwari, Rakesh M. Verma
On the Confluence of Linear Shallow Term Rewrite Systems. STACS (2003)
Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio
Paramodulation and Knuth-Bendix Completion with Nontotal and Nonmonotonic Orderings. J. Autom. Reason. 30 (1) (2003)
Guillem Godoy, Robert Nieuwenhuis
On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups. LICS (2001)
Hubert Comon, Guillem Godoy, Robert Nieuwenhuis
The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. FOCS (2001)
Miquel Bofill, Guillem Godoy
On the Completeness of Arbitrary Selection Strategies for Paramodulation. ICALP (2001)
Guillem Godoy, Robert Nieuwenhuis
Paramodulation with Built-in Abelian Groups. LICS (2000)
Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio
Modular Redundancy for Theorem Proving. FroCoS (2000)
Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio
Paramodulation with Non-Monotonic Orderings. LICS (1999)