Order-Sorted Rewriting and Congruence Closure
From MaRDI portal
Publication:2811360
Recommendations
- Completeness and confluence of order-sorted term rewriting
- A semantic approach to order-sorted rewriting
- A semantic approach to order-sorted rewriting
- Ordered rewriting and confluence
- Currying of order-sorted term rewriting systems
- Order-sorted equational unification revisited
- Higher-Order Orderings for Normal Rewriting
- scientific article; zbMATH DE number 176122
- scientific article; zbMATH DE number 1088278
- Strong and weak operational termination of order-sorted rewrite theories
Cites work
- scientific article; zbMATH DE number 3949706 (Why is no real title available?)
- scientific article; zbMATH DE number 4060701 (Why is no real title available?)
- scientific article; zbMATH DE number 1189278 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- A mechanical solution of Schubert's steamroller by many-sorted resolution
- Abstract congruence closure
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time
- An algorithm for reasoning about equality
- Any ground associative-commutative theory has a finite canonical system
- CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
- Canonized rewriting and ground AC completion modulo Shostak theories: design and implementation
- Combining equational reasoning
- Complexity, convexity and combinations of theories
- Computational aspects of an order-sorted logic with term declarations
- Deciding Combinations of Theories
- Equational completion in order-sorted algebras
- Fast Decision Procedures Based on Congruence Closure
- Inheritance hierarchies: Semantics and unifications
- Logics in Artificial Intelligence
- Order-Sorted Rewriting and Congruence Closure
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Shostak's congruence closure as completion
- Simplification by Cooperating Decision Procedures
- Solvable cases of the decision problem
- Specification and proof in membership equational logic
- The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
- Variations on the Common Subexpression Problem
Cited in
(11)- Order-Sorted Parameterization and Induction
- scientific article; zbMATH DE number 2043548 (Why is no real title available?)
- Normal forms and normal theories in conditional rewriting
- Order-Sorted Rewriting and Congruence Closure
- Abstract domains for reordering CLP(RLin) programs
- A partial evaluation framework for order-sorted equational programs modulo axioms
- A semantic approach to order-sorted rewriting
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Bi-rewriting, a term rewriting technique for monotonic order relations
- Currying of order-sorted term rewriting systems
- Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
This page was built for publication: Order-Sorted Rewriting and Congruence Closure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811360)
