Order-sorted completion: The many-sorted way

DOI10.1016/0304-3975(90)90105-QMaRDI QIDQ1177935zbMATH OpenFDO

Authors Harald Ganzinger

Publication date 26 June 1992

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(90)90105-Q

zbMATH Keywords

equational theorylogic programming

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Completeness and confluence of order-sorted term rewriting
• A semantic approach to order-sorted rewriting
• Semantics of order-sorted specifications

Cites work

• A completion procedure for conditional equations
• Completion of first-order clauses with equality by strict superposition
• Completion-time optimization of rewrite-time goal solving
• scientific article; zbMATH DE number 4016182 (Why is no real title available?)
• scientific article; zbMATH DE number 3921957 (Why is no real title available?)
• scientific article; zbMATH DE number 3938563 (Why is no real title available?)
• scientific article; zbMATH DE number 3949706 (Why is no real title available?)
• scientific article; zbMATH DE number 3981150 (Why is no real title available?)
• scientific article; zbMATH DE number 4056995 (Why is no real title available?)
• scientific article; zbMATH DE number 4060701 (Why is no real title available?)
• scientific article; zbMATH DE number 4078771 (Why is no real title available?)
• scientific article; zbMATH DE number 4078788 (Why is no real title available?)
• scientific article; zbMATH DE number 4090848 (Why is no real title available?)
• scientific article; zbMATH DE number 4089521 (Why is no real title available?)
• Investigations in many-sorted quantor logic
• Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation
• On restrictions of ordered paramodulation with simplification
• Semantics of computation

Cited in

(17)

• Semantics of order-sorted specifications
• A semantic approach to order-sorted rewriting
• MædMax: a maximal ordered completion tool
• Determinization of conditional term rewriting systems
• On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
• Specification and proof in membership equational logic
• scientific article; zbMATH DE number 3949706 (Why is no real title available?)
• Dynamically-typed computations for order-sorted equational presentations
• Harald Ganzinger's legacy: contributions to logics and programming
• From search to computation: redundancy criteria and simplification at work
• Completion-time optimization of rewrite-time goal solving
• A semantic approach to order-sorted rewriting
• Characterizing Compatible View Updates in Syntactic Bidirectionalization
• Inverse Unfold Problem and Its Heuristic Solving
• Termination proofs of well-moded logic programs via conditional rewrite systems
• Compatibility of order-sorted rewrite rules
• Equational completion in order-sorted algebras

This page was built for publication: Order-sorted completion: The many-sorted way

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177935)