Order-sorted completion: The many-sorted way

DOI10.1016/0304-3975(90)90105-QzbMath0736.68050MaRDI QIDQ1177935

Harald Ganzinger

Publication date: 26 June 1992

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

zbMATH Keywords

logic programmingequational theory

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (13)

Termination proofs of well-moded logic programs via conditional rewrite systems ⋮ Completion-time optimization of rewrite-time goal solving ⋮ Determinization of conditional term rewriting systems ⋮ On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories ⋮ Equational completion in order-sorted algebras ⋮ Inverse Unfold Problem and Its Heuristic Solving ⋮ Dynamically-typed computations for order-sorted equational presentations ⋮ Specification and proof in membership equational logic ⋮ Semantics of order-sorted specifications ⋮ Harald Ganzinger’s Legacy: Contributions to Logics and Programming ⋮ From Search to Computation: Redundancy Criteria and Simplification at Work ⋮ A semantic approach to order-sorted rewriting ⋮ Characterizing Compatible View Updates in Syntactic Bidirectionalization

Cites Work

• A completion procedure for conditional equations
• Investigations in many-sorted quantor logic
• Semantics of computation
• Completion-time optimization of rewrite-time goal solving
• Completion of first-order clauses with equality by strict superposition
• Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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