Guillem Godoy

发表

Unification on Compressed Terms

Guillem Godoy, 2009 .

The HOM problem is decidable

Guillem Godoy, Omer Giménez, Omer Giménez, 2013, J. ACM.

Recursive Path Orderings Can Also Be Incremental

Albert Rubio, Guillem Godoy, Mirtha Lina Fernández Venero, 2005, LPAR.

Classes of term rewrite systems with polynomial confluence problems

Ashish Tiwari, Robert Nieuwenhuis, Guillem Godoy, 2004, TOCL.

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories

Guillem Godoy, Florent Jacquemard, Carles Creus, 2013, Log. Methods Comput. Sci..

The Emptiness Problem for Tree Automata with Global Constraints

Guillem Godoy, Florent Jacquemard, Carles Creus, 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups

Robert Nieuwenhuis, Guillem Godoy, R. Nieuwenhuis, 2004, Constraints.

Paramodulation and Knuth–Bendix Completion with Nontotal and Nonmonotonic Orderings

Albert Rubio, Robert Nieuwenhuis, Guillem Godoy, 2003, Journal of Automated Reasoning.

On the Completeness of Arbitrary Selection Strategies for Paramodulation

Guillem Godoy, Miquel Bofill, Miquel Bofill, 2001, ICALP.

On ordering constraints for deduction with built-in Abelian semigroups, monoids and groups

Robert Nieuwenhuis, Guillem Godoy, R. Nieuwenhuis, 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

Paramodulation with built-in abelian groups

Robert Nieuwenhuis, Guillem Godoy, R. Nieuwenhuis, 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

Superposition with completely built-in Abelian groups

Robert Nieuwenhuis, Guillem Godoy, R. Nieuwenhuis, 2004, J. Symb. Comput..

Paramodulation with non-monotonic orderings

Albert Rubio, Robert Nieuwenhuis, Guillem Godoy, 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete pdf

Sebastian Maneth, Guillem Godoy, Omer Giménez, 2009, SIAM J. Comput..

Excessively duplicating patterns represent non-regular languages

Guillem Godoy, Carles Creus, Lander Ramos, 2014, Inf. Process. Lett..

Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints

Guillem Godoy, Adrià Gascón, Carles Creus, 2013, Journal of Automated Reasoning.

The HOM Problem is EXPTIME-Complete

Guillem Godoy, Adrià Gascón, Carles Creus, 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories

Ashish Tiwari, Guillem Godoy, Luis Barguñó, 2010, Log. Methods Comput. Sci..

Unique Normalization for Shallow TRS

Guillem Godoy, Florent Jacquemard, Florent Jacquemard, 2009, RTA.

Orderings for Innermost Termination

Albert Rubio, Guillem Godoy, Mirtha Lina Fernández Venero, 2005, RTA.

The HOM problem is decidable

Carme Àlvarez, Guillem Godoy, Lander Ramos, 2010, STOC '10.

Context unification with one context variable

Guillem Godoy, Adrià Gascón, Manfred Schmidt-Schauß, 2010, J. Symb. Comput..

Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules

Ashish Tiwari, Guillem Godoy, A. Tiwari, 2005, CADE.

Termination of Rewriting with Right-Flat Rules

Ashish Tiwari, Guillem Godoy, Eduard Huntingford, 2007, RTA.

Undecidable properties of flat term rewrite systems

Guillem Godoy, Hugo Hernández, Guillem Godoy, 2009, Applicable Algebra in Engineering, Communication and Computing.

The confluence of ground term rewrite systems is decidable in polynomial time

Robert Nieuwenhuis, Guillem Godoy, Hubert Comon-Lundh, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Classes of Tree Homomorphisms with Decidable Preservation of Regularity

Sebastian Maneth, Guillem Godoy, Sophie Tison, 2008, FoSSaCS.

On the Normalization and Unique Normalization Properties of Term Rewrite Systems

Guillem Godoy, Sophie Tison, S. Tison, 2007, CADE.