default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillem Godoy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]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: 108303 (2024)
2010 – 2019
- 2016
- [j18]Carles Creus, Adrià Gascón, Guillem Godoy, Lander Ramos:
The HOM Problem is EXPTIME-Complete. SIAM J. Comput. 45(4): 1230-1260 (2016) - 2014
- [j17]Carles Creus, Guillem Godoy, Lander Ramos:
Excessively duplicating patterns represent non-regular languages. Inf. Process. Lett. 114(3): 85-93 (2014) - [c30]Carles Creus, Guillem Godoy:
Automatic Evaluation of Context-Free Grammars (System Description). RTA-TLCA 2014: 139-148 - [c29]Carles Creus, Guillem Godoy:
Tree Automata with Height Constraints between Brothers. RTA-TLCA 2014: 149-163 - [c28]Carles Creus, Pau Fernández, Guillem Godoy:
Automatic Evaluation of Reductions between NP-Complete Problems. SAT 2014: 415-421 - 2013
- [j16]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) - [j15]Guillem Godoy, Omer Giménez:
The HOM problem is decidable. J. ACM 60(4): 23:1-23:44 (2013) - [j14]Carles Creus, Guillem Godoy, Francesc Massanes, Ashish Tiwari:
Non-Linear Rewrite Closure and Weak Normalization. J. Autom. Reason. 51(3): 281-324 (2013) - [j13]Carles Creus, Adrià Gascón, Guillem Godoy:
Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints. J. Autom. Reason. 51(4): 371-400 (2013) - 2012
- [c27]Carles Creus, Adrià Gascón, Guillem Godoy, Lander Ramos:
The HOM Problem is EXPTIME-Complete. LICS 2012: 255-264 - [c26]Carles Creus, Adrià Gascón, Guillem Godoy:
One-context Unification with STG-Compressed Terms is in NP. RTA 2012: 149-164 - 2011
- [j12]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): 446-464 (2011) - [j11]Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß:
Unification and matching on compressed terms. ACM Trans. Comput. Log. 12(4): 26:1-26:37 (2011) - [c25]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: 93-98 - 2010
- [j10]Guillem Godoy:
Normalization properties for Shallow TRS and Innermost Rewriting. Appl. Algebra Eng. Commun. Comput. 21(2): 109-129 (2010) - [j9]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) - [j8]Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß, Ashish Tiwari:
Context unification with one context variable. J. Symb. Comput. 45(2): 173-193 (2010) - [c24]Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher:
The Emptiness Problem for Tree Automata with Global Constraints. LICS 2010: 263-272 - [c23]Guillem Godoy, Omer Giménez, Lander Ramos, Carme Àlvarez:
The HOM problem is decidable. STOC 2010: 485-494 - [i2]Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß:
Unification and Matching on Compressed Terms. CoRR abs/1003.1632 (2010)
2000 – 2009
- 2009
- [j7]Guillem Godoy, Hugo Hernández:
Undecidable properties of flat term rewrite systems. Appl. Algebra Eng. Commun. Comput. 20(2): 187-205 (2009) - [c22]Carles Creus, Guillem Godoy, Francesc Massanes, Ashish Tiwari:
Non-linear Rewrite Closure and Weak Normalization. LICS 2009: 365-374 - [c21]Guillem Godoy, Florent Jacquemard:
Unique Normalization for Shallow TRS. RTA 2009: 63-77 - [c20]Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß:
Unification with Singleton Tree Grammars. RTA 2009: 365-379 - [c19]Guillem Godoy, Ashish Tiwari:
Invariant Checking for Programs with Procedure Calls. SAS 2009: 326-342 - [i1]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 abs/0911.3674 (2009) - 2008
- [c18]Guillem Godoy, Sebastian Maneth, Sophie Tison:
Classes of Tree Homomorphisms with Decidable Preservation of Regularity. FoSSaCS 2008: 127-141 - [c17]Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß:
Context Matching for Compressed Terms. LICS 2008: 93-102 - [c16]Adrià Gascón, Guillem Godoy, Florent Jacquemard:
Closure of Tree Automata Languages under Innermost Rewriting. WRS@RTA 2008: 23-38 - 2007
- [c15]Guillem Godoy, Sophie Tison:
On the Normalization and Unique Normalization Properties of Term Rewrite Systems. CADE 2007: 247-262 - [c14]Guillem Godoy, Eduard Huntingford:
Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems. RTA 2007: 184-199 - [c13]Guillem Godoy, Eduard Huntingford, Ashish Tiwari:
Termination of Rewriting with Right-Flat Rules. RTA 2007: 200-213 - 2005
- [c12]Guillem Godoy, Ashish Tiwari:
Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules. CADE 2005: 164-176 - [c11]Guillem Godoy, Ashish Tiwari:
Confluence of Shallow Right-Linear Rewrite Systems. CSL 2005: 541-556 - [c10]Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio:
Recursive Path Orderings Can Also Be Incremental. LPAR 2005: 230-245 - [c9]Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio:
Orderings for Innermost Termination. RTA 2005: 17-31 - 2004
- [j6]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): 13-36 (2004) - [j5]Guillem Godoy, Ashish Tiwari, Rakesh M. Verma:
Deciding confluence of certain term rewriting systems in polynomial time. Ann. Pure Appl. Log. 130(1-3): 33-59 (2004) - [j4]Guillem Godoy, Robert Nieuwenhuis:
Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups. Constraints An Int. J. 9(3): 167-192 (2004) - [j3]Guillem Godoy, Robert Nieuwenhuis:
Superposition with completely built-in Abelian groups. J. Symb. Comput. 37(1): 1-33 (2004) - [j2]Guillem Godoy, Robert Nieuwenhuis, Ashish Tiwari:
Classes of term rewrite systems with polynomial confluence problems. ACM Trans. Comput. Log. 5(2): 321-331 (2004) - [c8]Guillem Godoy, Ashish Tiwari:
Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure. IJCAR 2004: 91-106 - 2003
- [j1]Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio:
Paramodulation and Knuth-Bendix Completion with Nontotal and Nonmonotonic Orderings. J. Autom. Reason. 30(1): 99-120 (2003) - [c7]Guillem Godoy, Ashish Tiwari, Rakesh M. Verma:
On the Confluence of Linear Shallow Term Rewrite Systems. STACS 2003: 85-96 - 2001
- [b1]Guillem Godoy:
Automated deduction with built-in theories: completeness results and constraint solving techniques. Polytechnic University of Catalonia, Spain, 2001 - [c6]Hubert Comon, Guillem Godoy, Robert Nieuwenhuis:
The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. FOCS 2001: 298-307 - [c5]Miquel Bofill, Guillem Godoy:
On the Completeness of Arbitrary Selection Strategies for Paramodulation. ICALP 2001: 951-962 - [c4]Guillem Godoy, Robert Nieuwenhuis:
On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups. LICS 2001: 38-47 - 2000
- [c3]Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio:
Modular Redundancy for Theorem Proving. FroCoS 2000: 186-199 - [c2]Guillem Godoy, Robert Nieuwenhuis:
Paramodulation with Built-in Abelian Groups. LICS 2000: 413-424
1990 – 1999
- 1999
- [c1]Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio:
Paramodulation with Non-Monotonic Orderings. LICS 1999: 225-233
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
