Special relations in automated deduction
Journal of the ACM (JACM) - The MIT Press scientific computation series
Unified algebras and institutions
Proceedings of the Fourth Annual Symposium on Logic in computer science
Conference proceedings on Algebraic methodology and software technology
Handbook of theoretical computer science (vol. B)
Journal of Symbolic Computation
Completion of rewrite systems with membership constraints. Part I: deduction rules
Journal of Symbolic Computation - Special issue: order-sorted rewriting
Partial Algebra + Order-Sorted Algebra = Galactic Algebra
TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
Term Rewriting in a Logic of Special Relations
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Operational Semantics of OBJ-3 (Extended Abstract)
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Specification and Proof in Membership Equational Logic
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Order-Sorted Completion: The Many-Sorted Way (Extended Abstract)
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Equational Completion in Order-Sorted Algebras (Extended Abstract)
CAAP '88 Proceedings of the 13th Colloquium on Trees in Algebra and Programming
The Special-Relation Rules are Incomplete
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Classified Algebras
Term Rewriting in a Logic of Special Relations
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Structures for Abstract Rewriting
Journal of Automated Reasoning
| Hi-index | 0.00 |
Although there exist logics that extend the expressiveness of order-sorted equational logic using additional binary relations besides equality in their logical theories, standard equational rewriting is still the foundation of their operational semantics. But rewriting is not necessarily restricted to the replacement of equals by equals only, and can be generalized to other 'special' binary relations. I show in this paper that by applying rewrite techniques to logical theories considered as instances of a general 'logic of special relations' we can unify and hence simplify the computational analysis within these theories.