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
no 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 24 matches
- 1985
- Hassan Aït-Kaci:
Solving Type Equations by Graph Rewriting. RTA 1985: 158-179 - Stefan Arnborg, Erik Tidén:
Unification Problems with One-Sided Distributivity. RTA 1985: 398-406 - Leo Bachmair, David A. Plaisted:
Associative Path Orderings. RTA 1985: 241-254 - Dan Benanav, Deepak Kapur, Paliath Narendran:
Complexity of Matching Problems. RTA 1985: 417-429 - Ronald V. Book:
Thue Systems as Rewriting Systems. RTA 1985: 63-94 - Bruno Buchberger:
Basic Features and Development of the Critical-Pair/Completion Procedure. RTA 1985: 1-45 - Christine Choppy, Colette Johnen:
PETRIREVE: Proving Petri Net Properties with Rewriting Systems. RTA 1985: 271-286 - Stavros S. Cosmadakis, Paris C. Kanellakis:
Two Applications of Equational Theories to Database Theory. RTA 1985: 107-123 - Nachum Dershowitz:
Termination. RTA 1985: 180-224 - David Detlefs, Randy Forgaard:
A Procedure for Automatically Proving the Termination of a Set of Rewrite Rules. RTA 1985: 255-270 - Albrecht Fortenbacher:
An Algebraic Approch to Unification Under Assoiativity and Commutativity. RTA 1985: 381-397 - Laurent Fribourg:
Handling Function Definitions through Innermost Superposition and Rewriting. RTA 1985: 325-344 - Jieh Hsiang:
Two Results in Term Rewriting Theorem Proving. RTA 1985: 301-324 - Neil D. Jones, Peter Sestoft, Harald Søndergaard:
An Experiment in Partial Evaluation: The Generation of a Compiler Generator. RTA 1985: 124-140 - Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran:
An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras. RTA 1985: 345-364 - Friedrich Otto:
Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems. RTA 1985: 95-106 - Sara Porat, Nissim Francez:
Fairness in Term Rewriting Systems. RTA 1985: 287-300 - Paul Walton Purdom Jr., Cynthia A. Brown:
Fast Many-to-One Matching Algorithms. RTA 1985: 407-416 - Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne:
NARROWER: A New Algorithm for Unification and Its Application to Logic Programming. RTA 1985: 141-157 - Michaël Rusinowitch:
Path of Subterms Ordering and Recursive Decomposition Ordering Revisited. RTA 1985: 225-240 - Katherine A. Yelick:
Combining Unification Algorithms for Confined Regular Equational Theories. RTA 1985: 365-380 - Marek Zaionc:
The Set of Unifiers in Typed Lambda-Calculus as Regular Expression. RTA 1985: 430-440 - Hantao Zhang, Jean-Luc Rémy:
Contextual Rewriting. RTA 1985: 46-62 - Jean-Pierre Jouannaud:
Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings. Lecture Notes in Computer Science 202, Springer 1985, ISBN 3-540-15976-2 [contents]
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-16 14:39 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