default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
Likely matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 916 matches
- 2024
- Jan A. Bergstra, John V. Tucker:
Eager Term Rewriting For The Fracterm Calculus Of Common Meadows. Comput. J. 67(5): 1866-1871 (2024) - Thaïs Baudon, Carsten Fuhs, Laure Gonnord:
On Complexity Bounds and Confluence of Parallel Term Rewriting. Fundam. Informaticae 192(2): 121-166 (2024) - Étienne Payet:
Non-termination in Term Rewriting and Logic Programming. J. Autom. Reason. 68(1): 4 (2024) - Rick Erkens:
Optimizing term rewriting with creeper trace transducers. J. Log. Algebraic Methods Program. 141: 100987 (2024) - Salvador Lucas:
Local confluence of conditional and generalized term rewriting systems. J. Log. Algebraic Methods Program. 136: 100926 (2024) - Jan-Christoph Kassing, Stefan Dollase, Jürgen Giesl:
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting. FLOPS 2024: 62-80 - Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl:
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting. FoSSaCS (2) 2024: 206-228 - Takahito Aoto, Naoki Nishida, Jonas Schöpf:
Equational Theories and Validity for Logically Constrained Term Rewriting. FSCD 2024: 31:1-31:21 - Franz Baader, Jürgen Giesl:
On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems. FSCD 2024: 16:1-16:18 - Salvador Lucas:
Termination of Generalized Term Rewriting Systems. FSCD 2024: 32:1-32:18 - Hubie Chen, Stefan Mengel:
Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. ICDT 2024: 16:1-16:17 - Jan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl:
A Dependency Pair Framework for Relative Termination of Term Rewriting. IJCAR (2) 2024: 360-380 - Takahito Aoto:
Proving Uniqueness of Normal Forms w.r.t Reduction of Term Rewriting Systems. LOPSTR 2024: 185-201 - Kasper Hagens, Cynthia Kop:
Rewriting Induction for Higher-Order Constrained Term Rewriting Systems. LOPSTR 2024: 202-219 - Michael Lienhardt:
The Hrewrite Library: A Term Rewriting Engine for Automatic Code Assembly. WRLA 2024: 165-178 - Jean-Pierre Jouannaud:
Confluence of Terminating Rewriting Computations. The French School of Programming 2024: 265-306 - Adriano Barile, Stefano Berardi, Luca Roversi:
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem. CoRR abs/2401.02091 (2024) - Pierre-Louis Curien, Guillaume Laplante-Anfossi:
Term rewriting on nestohedra. CoRR abs/2403.15987 (2024) - Jan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl:
A Dependency Pair Framework for Relative Termination of Term Rewriting. CoRR abs/2404.15248 (2024) - Takahito Aoto, Naoki Nishida, Jonas Schöpf:
Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version). CoRR abs/2405.01174 (2024) - Jan-Christoph Kassing, Jürgen Giesl:
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting. CoRR abs/2408.06768 (2024) - 2023
- Johri van Eerd, Jan Friso Groote, Pieter Hijma, Jan Martens, Muhammad Osama, Anton Wijs:
Innermost many-sorted term rewriting on GPUs. Sci. Comput. Program. 225: 102910 (2023) - Jan-Christoph Kassing, Jürgen Giesl:
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs. CADE 2023: 344-364 - Jaehyung Lee, Woosuk Lee:
Simplifying Mixed Boolean-Arithmetic Obfuscation by Program Synthesis and Term Rewriting. CCS 2023: 2351-2365 - Ryota Haga, Yuki Kagaya, Takahito Aoto:
A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems. FroCoS 2023: 99-116 - Akihisa Yamada:
Termination of Term Rewriting: Foundation, Formalization, Implementation, and Competition (Invited Talk). FSCD 2023: 4:1-4:5 - Samuel Mimram:
Categorical Coherence from Term Rewriting Systems. FSCD 2023: 16:1-16:17 - Adriano Barile, Stefano Berardi, Luca Roversi:
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem. ICTCS 2023: 31-43 - Jan-Christoph Kassing, Jürgen Giesl:
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs. CoRR abs/2305.11741 (2023) - Thaïs Baudon, Carsten Fuhs, Laure Gonnord:
On Complexity Bounds and Confluence of Parallel Term Rewriting. CoRR abs/2305.18250 (2023)
skipping 886 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-19 00:06 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint