Term rewriting in a logic of special relations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1548, Issue , 1998, Pages 178-195

  Schorlemmer, W Marco ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BINS; COMPUTER CIRCUITS; RECONFIGURABLE HARDWARE; SEMANTICS; SOFTWARE ENGINEERING;

BINARY RELATION; COMPUTATIONAL ANALYSIS; LOGICAL THEORIES; OPERATIONAL SEMANTICS; ORDER SORTED EQUATIONAL LOGIC; TERM REWRITING;

COMPUTATION THEORY;

EID: 77955088549     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49253-4_15     Document Type: Conference Paper

References (21)

1. L. Bachmair and H. Ganzinger. Ordered chaining calculi for first-order theories of binary relations. Technical Report MPI-I-95-2-009, Max-Plank-Institut für Informatik, 1995
2. A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. In TAPSOFT'97, volume 1214 of Lecture Notes in Computer Science, pages 67-92. Springer, 1997
3. H. Comon. Completion of rewrite systems with membership constraints, Part I: Deduction rules. Journal of Symbolic Computation, 25(4):397-419, 1998
4. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B. Elsevier Science, 1990
5. S. Eker and J. Meseguer. Design of the equational proving tools for Cafe, Mar. 1997. Slides of a talk given at the Cafe Workshop, Japan
6. P. J. Freyd and A. Scedrov. Categories, Allegories. North-Holland, 1990
7. H. Ganzinger. Order-sorted completion: The many-sorted way. In TAPSOFT '89, volume 351 of Lecture Notes in Computer Science, pages 244-258. Springer, 1989
8. I. Gnaedig, C. Kirchner, and H. Kirchner. Equational completion in order-sorted algebras. In CAAP '88, volume 299 of Lecture Notes in Computer Science, pages 165-184. Springer, 1988
9. G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797-821, 1980
10. C. Kirchner, H. Kirchner, and J. Meseguer. Operational semantics of OBJ-3. In ICALP '88, volume 317 of Lecture Notes in Computer Science. Springer, 1988
11. J. Levy and J. Agustí. Bi-rewrite systems. Journal of Symbolic Computation, 22(3):279-314, 1996
12. V. Manca, A. Salibra, and G. Scollo. Equational type logic. Theoretical Computer Science, 77:131-159, 1990
13. Z. Manna and R. Waldinger. Special relations in automated deduction. Journal of the ACM, 33(1):1-59, 1986
14. Z. Manna and R. Waldinger. The special-relation rules are incomplete. In Auto-mated Deduction -CADE-11, volume 607 of Lecture Notes in Artificial Intelligence, pages 492-506. Springer, 1992
15. A. Mégrelis. Partial algebra + order-sorted algebra = galactic algebra. In Logi-cal Foundations of Computer Science, volume 620 of Lecture Notes in Computer Science, pages 314-325. Springer, 1992
16. J. Meseguer. Membership algebras, July 1996. Lecture at the Dagstuhl Seminar on Specification and Semantics
17. P. Mosses. Uniéd algebras and institutions. In Principles of Programming Lan-guages Conference, pages 304-312. ACM Press, 1989
18. W. M. Schorlemmer. Bi-rewriting rewriting logic. In First International Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 1996
19. W. M. Schorlemmer. Un càlcul de demostració per a la lógica de reescriptura. Research Report IIIA 96/28, Institut d'Investigació en Intelèligéncial Artificial (CSIC), Dec. 1996. In Catalan
20. W. M. Schorlemmer. Rewriting logic as a logic of special relations. In Second International Workshop on Rewriting Logic and its Applications, volume 15 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 1998
21. W. W. Wadge. Classiéd algebras. Research Report 46, Depatment of Computer Science, University of Warwick, 1982.