Deciding the Word Problem in the Union of Equational Theories Sharing Constructors

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

Deciding the Word Problem in the Union of Equational Theories Sharing Constructors

Franz BaaderFranz Baader,  Cesare TinelliCesare Tinelli
Deciding the Word Problem in the Union of Equational Theories Sharing Constructors


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
  • 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
The final publication is available at Springer.
@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},
}