Остановите войну!
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 41 matches
- 1991
- Raj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie:
The Tecton Proof System. RTA 1991: 442-444 - Jürgen Avenhaus:
Proving Equational and Inductive Theorems by Completion and Embedding Techniques. RTA 1991: 361-373 - Franz Baader:
Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems. RTA 1991: 86-97 - Franz Baader, Werner Nutt:
Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification. RTA 1991: 124-135 - Françoise Bellegarde:
Program Transformation and Rewriting. RTA 1991: 226-239 - Michel Billaud:
ANIGRAF: An Interactive System for the Animation of Graph Rewriting Systems with Priorities. RTA 1991: 437-438 - Maria Paola Bonacina, Jieh Hsiang:
On Fairness of Completion-Based Theorem Proving Strategies. RTA 1991: 348-360 - Franz-Josef Brandenburg:
The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. RTA 1991: 312-322 - Reinhard Bündgen:
Simulation Buchberger's Algorithm by Knuth-Bendix Completion. RTA 1991: 386-397 - Jacques Chabin, Pierre Réty:
Narrowing Directed by a Graph of Terms. RTA 1991: 112-123 - Dave Cohen, Phil Watson:
An Efficient Representation of Arithmetic for Term Rewriting. RTA 1991: 240-251 - Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi:
Bottom-Up Tree Pushdown Automata and Rewrite Systems. RTA 1991: 287-298 - Pierre-Louis Curien, Giorgio Ghelli:
On Confluence for Weakly Normalizing Systems. RTA 1991: 215-225 - Sieger van Denneheuvel, Karen L. Kwast, Gerard R. Renardel de Lavalette, Edith Spaan:
Query Optimization Using Rewrite Rules. RTA 1991: 252-263 - Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop:
Open Problems in Rewriting. RTA 1991: 445-456 - Aline Deruyver:
EMMY: A Refutational Theorem Prover for First-Order Logic with Equation. RTA 1991: 439-441 - Eric Domenjoud:
AC Unification Through Order-Sorted AC1 Unification. RTA 1991: 98-111 - Daniel J. Dougherty:
Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract). RTA 1991: 37-48 - Frank Drewes, Clemens Lautemann:
Incremental Termination Proofs and the Length of Derivations. RTA 1991: 49-61 - William M. Farmer, Ronald J. Watro:
Redex Capturing in Term Graph Rewriting (Concise Version). RTA 1991: 13-24 - Ulrich Fraus:
A Narrowing-Based Theorem Prover. RTA 1991: 435-436 - Albert Gräf:
Left-to-Right Tree Pattern Matching. RTA 1991: 323-334 - Miki Hermann:
On Proving Properties of Completion Strategies. RTA 1991: 398-410 - Dieter Hofbauer:
Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding. RTA 1991: 62-73 - Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract). RTA 1991: 1-12 - Hélène Kirchner:
Proofs in Parameterized Specification. RTA 1991: 174-187 - Francis Klay:
Undecidable Properties of Syntactic Theories. RTA 1991: 136-149 - Stefan Krischer, Alexander Bockmayr:
Detecting Redundant Narrowing Derivations by the LSE-SL Reducability Test. RTA 1991: 74-85 - Gregory Kucherov:
On Relationship Between Term Rewriting Systems and Regular Tree Languages. RTA 1991: 299-311 - Claude Marché:
On Ground AC-Completion. RTA 1991: 411-422
skipping 11 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-30 11:15 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