- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
29 cm
- Extent
-
90 Bl.
- Language
-
Deutsch
- Notes
-
graph. Darst.
Literaturverz. Bl. 87 - 90
- Bibliographic citation
-
Forschungsberichte des Fachbereiches Informatik / Technische Universität Berlin ; Bericht 1992,46
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Leiter der Fachbibliothek Informatik, Sekretariat FR 5-4
- (when)
-
[1992]
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:51 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Hofbauer, Dieter
- Leiter der Fachbibliothek Informatik, Sekretariat FR 5-4
Time of origin
- [1992]
Other Objects (12)
Termination Proofs of Rewriting Systems
Using SOS definitions in term rewriting proofs
Automated termination proofs
The DP framework for proving termination of term rewriting
Continuous semantics for termination proofs
Termination proofs for logic programs
Termination proofs for logic programs
Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems
Static termination analysis for prolog using term rewriting and SAT solving
Simplification orders in term rewriting : derivation lengths, order types, and computability
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
On termination of single pushout graph rewriting
Termination Proofs of Rewriting Systems
Using SOS definitions in term rewriting proofs
Automated termination proofs
The DP framework for proving termination of term rewriting
Continuous semantics for termination proofs
Termination proofs for logic programs
Termination proofs for logic programs
Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems
Static termination analysis for prolog using term rewriting and SAT solving
Simplification orders in term rewriting : derivation lengths, order types, and computability
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
On termination of single pushout graph rewriting
Termination Proofs of Rewriting Systems
Using SOS definitions in term rewriting proofs
Automated termination proofs
The DP framework for proving termination of term rewriting
Continuous semantics for termination proofs
Termination proofs for logic programs
Termination proofs for logic programs
Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems
Static termination analysis for prolog using term rewriting and SAT solving
Simplification orders in term rewriting : derivation lengths, order types, and computability
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs