LATPub170: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| (2 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt) | |||
| Zeile 1: | Zeile 1: | ||
{{Publikation Erster Autor | {{Publikation Erster Autor | ||
|ErsterAutorVorname= | |ErsterAutorVorname=Franz | ||
|ErsterAutorNachname=Baader | |ErsterAutorNachname=Baader | ||
|FurtherAuthors= | |FurtherAuthors=Cesare Tinelli | ||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
| Zeile 10: | Zeile 10: | ||
|Month= | |Month= | ||
|Booktitle=Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA-99) | |Booktitle=Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA-99) | ||
|Editor=P. | |Editor=P. Narendran and M. Rusinowitch | ||
|Note= | |Note= | ||
|Organization= | |Organization= | ||
|Pages=175 | |Pages=175-189 | ||
|Publisher=Springer | |Publisher=Springer | ||
|Series=Lecture Notes in Computer Science | |Series=Lecture Notes in Computer Science | ||
| Zeile 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=The main contribution of this paper is a new method for | |Abstract=The main contribution of this paper is a new method for combining decision procedures for the word problem in equational theories sharing ``constructors.'' The notion of constructor adopted in this paper has a nice algebraic definition and is more general than a related notion introduced in previous work on the combination problem. | ||
combining decision procedures for the word problem in equational | |||
theories sharing ``constructors.'' The notion of constructor | |||
adopted in this paper has a nice algebraic definition and is more | |||
general than a related notion introduced in previous work on the | |||
combination problem. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 48: | Zeile 41: | ||
year = {1999}, | year = {1999}, | ||
} | } | ||
}} | }} | ||
Aktuelle Version vom 25. März 2015, 16:34 Uhr
Deciding the Word Problem in the Union of Equational Theories Sharing Constructors
Franz BaaderFranz Baader, Cesare TinelliCesare Tinelli
Franz Baader, Cesare Tinelli
Deciding the Word Problem in the Union of Equational Theories Sharing Constructors
In P. Narendran and M. Rusinowitch, eds., Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA-99), volume 1631 of Lecture Notes in Computer Science, 175-189, 1999. Springer
Deciding the Word Problem in the Union of Equational Theories Sharing Constructors
In P. Narendran and M. Rusinowitch, eds., Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA-99), volume 1631 of Lecture Notes in Computer Science, 175-189, 1999. Springer
- KurzfassungAbstract
The main contribution of this paper is a new method for combining decision procedures for the word problem in equational theories sharing ``constructors. The notion of constructor adopted in this paper has a nice algebraic definition and is more general than a related notion introduced in previous work on the combination problem. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Baader-Tinelli-RTA-99,
address = {Trento, Italy},
author = {F. {Baader} and C. {Tinelli}},
booktitle = {Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA-99)},
editor = {P. {Narendran} and M. {Rusinowitch}},
pages = {175--189},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science},
title = {Deciding the Word Problem in the Union of Equational Theories Sharing Constructors},
volume = {1631},
year = {1999},
}
