The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Guillem Godoy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  22. Classes of Tree Homomorphisms with Decidable Preservation of Regularity. [Citation Graph (, )][DBLP]


  23. Context Matching for Compressed Terms. [Citation Graph (, )][DBLP]


  24. Non-linear Rewrite Closure and Weak Normalization. [Citation Graph (, )][DBLP]


  25. The Emptiness Problem for Tree Automata with Global Constraints. [Citation Graph (, )][DBLP]


  26. Unification with Singleton Tree Grammars. [Citation Graph (, )][DBLP]


  27. Unique Normalization for Shallow TRS. [Citation Graph (, )][DBLP]


  28. Invariant Checking for Programs with Procedure Calls. [Citation Graph (, )][DBLP]


  29. The HOM problem is decidable. [Citation Graph (, )][DBLP]


  30. Undecidable properties of flat term rewrite systems. [Citation Graph (, )][DBLP]


  31. Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete [Citation Graph (, )][DBLP]


  32. Unification and Matching on Compressed Terms [Citation Graph (, )][DBLP]


  33. Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories [Citation Graph (, )][DBLP]


  34. Closure of Tree Automata Languages under Innermost Rewriting. [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.022secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002