Остановите войну!
for scientists:
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 36 matches
- 2003
- Takahito Aoto, Toshiyuki Yamada:
Termination of Simply Typed Term Rewriting by Translation and Labelling. RTA 2003: 380-394 - Gilles Barthe, Sorin Stratulat:
Validation of the JavaCard Platform with Implicit Induction Techniques. RTA 2003: 337-351 - Frédéric Blanqui:
Rewriting Modulo in Deduction Modulo. RTA 2003: 395-409 - Cristina Borralleras, Albert Rubio:
Monotonic AC-Compatible Semantic Path Orderings. RTA 2003: 279-295 - Olivier Bournez, Guy-Marie Côme, Valérie Conraud, Hélène Kirchner, Liliana Ibanescu:
A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms. RTA 2003: 30-45 - Olivier Bournez, Mathieu Hoyrup:
Rewriting Logic and Probabilities. RTA 2003: 61-75 - Mark van den Brand, Pierre-Etienne Moreau, Jurgen J. Vinju:
Environments for Term Rewriting Engines for Free! RTA 2003: 424-435 - H. J. Sander Bruggink:
Residuals in Higher-Order Rewriting. RTA 2003: 123-137 - Feng Chen, Grigore Rosu, Ram Prasad Venkatesan:
Rule-Based Analysis of Dimensional Safety. RTA 2003: 197-207 - Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott:
The Maude 2.0 System. RTA 2003: 76-87 - Hubert Comon-Lundh, Véronique Cortier:
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. RTA 2003: 148-164 - Silvano Dal-Zilio, Denis Lugiez:
XML Schema, Tree Logic and Sheaves Automata. RTA 2003: 246-263 - Gilles Dowek:
Confluence as a Cut Elimination Property. RTA 2003: 2-13 - Steven Eker:
Associative-Commutative Rewriting on Large Terms. RTA 2003: 14-29 - Julien Forest, Delia Kesner:
Expression Reduction Systems with Patterns. RTA 2003: 107-122 - Alfons Geser:
Termination of String Rewriting Rules That Have One Pair of Overlaps. RTA 2003: 410-423 - Neil Ghani, Anne Heyworth:
A Rewriting Alternative to Reidemeister-Schreier. RTA 2003: 452-466 - Jean-Louis Giavitto:
Invited Talk: Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems. RTA 2003: 208-233 - Jürgen Giesl, Hans Zantema:
Liveness in Rewriting. RTA 2003: 321-336 - Adam Granicz, Daniel M. Zimmerman, Jason Hickey:
Rewriting UNITY. RTA 2003: 138-147 - Nao Hirokawa, Aart Middeldorp:
Tsukuba Termination Tool. RTA 2003: 311-320 - Deepak Kapur, Paliath Narendran, Lida Wang:
An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation. RTA 2003: 165-179 - Zurab Khasidashvili, John R. W. Glauert:
Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication). RTA 2003: 467-482 - Temur Kutsia:
Equational Prover of THEOREMA. RTA 2003: 367-379 - Patrick Lincoln:
Invited Talk: Symbolic Systems Biology. RTA 2003: 1 - David A. McAllester:
Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference. RTA 2003: 436-451 - Georg Moser, Andreas Weiermann:
Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. RTA 2003: 296-310 - Hitoshi Ohsaki, Hiroyuki Seki, Toshinori Takai:
Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism. RTA 2003: 483-498 - Grigore Rosu, Mahesh Viswanathan:
Testing Extended Regular Language Membership Incrementally by Rewriting. RTA 2003: 499-514 - Sylvain Salvati, Philippe de Groote:
On the Complexity of Higher-Order Matching in the Linear lambda-Calculus. RTA 2003: 234-245
skipping 6 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-05-11 03:56 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