The SCEAS System
| |||||||

## Search the dblp DataBase
Guillem Godoy:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - Guillem Godoy, Ashish Tiwari
**Confluence of Shallow Right-Linear Rewrite Systems.**[Citation Graph (0, 0)][DBLP] CSL, 2005, pp:541-556 [Conf] - 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] - Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio
**Modular Redundancy for Theorem Proving.**[Citation Graph (0, 0)][DBLP] FroCos, 2000, pp:186-199 [Conf] - Miquel Bofill, Guillem Godoy
**On the Completeness of Arbitrary Selection Strategies for Paramodulation.**[Citation Graph (0, 0)][DBLP] ICALP, 2001, pp:951-962 [Conf] - Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio
**Paramodulation with Non-Monotonic Orderings.**[Citation Graph (0, 0)][DBLP] LICS, 1999, pp:225-233 [Conf] - Guillem Godoy, Robert Nieuwenhuis
**Paramodulation with Built-in Abelian Groups.**[Citation Graph (0, 0)][DBLP] LICS, 2000, pp:413-424 [Conf] - 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] - 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] - Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio
**Orderings for Innermost Termination.**[Citation Graph (0, 0)][DBLP] RTA, 2005, pp:17-31 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - Guillem Godoy, Eduard Huntingford, Ashish Tiwari
**Termination of Rewriting with Right-Flat Rules.**[Citation Graph (0, 0)][DBLP] RTA, 2007, pp:200-213 [Conf] **Classes of Tree Homomorphisms with Decidable Preservation of Regularity.**[Citation Graph (, )][DBLP]**Context Matching for Compressed Terms.**[Citation Graph (, )][DBLP]**Non-linear Rewrite Closure and Weak Normalization.**[Citation Graph (, )][DBLP]**The Emptiness Problem for Tree Automata with Global Constraints.**[Citation Graph (, )][DBLP]**Unification with Singleton Tree Grammars.**[Citation Graph (, )][DBLP]**Unique Normalization for Shallow TRS.**[Citation Graph (, )][DBLP]**Invariant Checking for Programs with Procedure Calls.**[Citation Graph (, )][DBLP]**The HOM problem is decidable.**[Citation Graph (, )][DBLP]**Undecidable properties of flat term rewrite systems.**[Citation Graph (, )][DBLP]**Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete**[Citation Graph (, )][DBLP]**Unification and Matching on Compressed Terms**[Citation Graph (, )][DBLP]**Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories**[Citation Graph (, )][DBLP]**Closure of Tree Automata Languages under Innermost Rewriting.**[Citation Graph (, )][DBLP]
Search in 0.020secs, Finished in 0.022secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |