Combining word problems through rewriting in categories with products

Theoretical Computer Science

Volumn 294, Issue 1-2, 2003, Pages 103-149

  Fiorentini, Camillo ^a   Ghilardi, Silvio ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Combined word problems; Functorial semantics; Rewrite systems

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DECISION MAKING; THEOREM PROVING;

REWRITE SYSTEMS;

PROBLEM SOLVING;

EID: 0037441255     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00248-1     Document Type: Conference Paper

References (13)

1. Andréka H., Kurucz Á., Németi I., Sain I., Simon A. Causes and remedies for undecidability in arrow logics and in multi-modal logics. Marx M., Polos L., Masuch M. Arrow Logic and Multi-modal logic. 1996;63-99 CSLI Publ. Stanford, CA.
2. Baader F., Nipkow T. Term Rewriting and all that. 1998;Cambridge University Press, Cambridge.
3. Baader F., Tinelli C. Deciding the word problem in the union of equational theories sharing constructors. Narendran P., Rusinowitch M. Rewriting Techniques and Applications (Trento, 1999). 1999;175-189 Springer, Berlin.
4. F. Baader, C. Tinelli, Deciding the word problem in the union of equational theories, Inform. and Computation, Special issue of selected papers from RTA'99, in preparation.
5. Domenjoud E., Klay F., Ringeissen C. Combination techniques for nondisjoint equational theories. Bundy A. Proc. CADE-12, Lecture Notes in Artificial Intelligence. Vol. 814:1996;48-64 Springer, Berlin.
6. C. Fiorentini, S. Ghilardi, Path Rewriting and combined word problems, Technical Report 250-00, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, 2000, Available at http://gongolo.usr.dsi.unimi.it/̃fiorenti/download/tr_250-00.ps.gz.
7. Freyd P.J., Kelly G.M. Categories of continuous functors. I. J. Pure Appl. Algebra. 2:1972;169-191.
8. Ghilardi S. An algebraic theory of normal forms. Ann. Pure Appl. Logic. 71(3):1991;189-245.
9. Ghilardi S., Meloni G.C. Modal logics with. n -ary connectives Z. Math. Logik Grundlag. Math. 36(3):1990;193-215.
10. Lawvere F.W. Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci. USA. 50:1963;869-872.
11. C. Lüth, Categorical term rewriting: monads and modularity, Ph.D. Thesis, University of Edinburgh, 1997.
12. Nipkow T. Combining matching algorithms. the regular case J. Symbolic Comput. 12(6):1991;633-653.
13. Pigozzi D. The join of equational theories. Colloq. Math. 30:1974;15-25.