Guillem Godoy

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