scientific article; zbMATH DE number 3856444

zbMATH Open0538.68072MaRDI QIDQ3325075FDOQ3325075

Authors: Wolfgang Küchlin 

Publication date: 1982

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4076598
• scientific article; zbMATH DE number 44069
• scientific article; zbMATH DE number 3928345
• Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation
• Some experiments with a completion theorem prover

zbMATH Keywords

computational logicKnuth-Bendix algorithmresolution theorem-provingalgebraic abstract data type completion

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (15)

• Solving divergence in Knuth--Bendix completion by enriching signatures
• On pot, pans and pudding or how to discover generalised critical pairs
• Buchberger's algorithm: The term rewriter's point of view
• Title not available (Why is that?)
• Knuth-Bendix completion for non-symmetric transitive relations
• Abstract reduction systems and idea of Knuth-Bendix completion algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• History and basic features of the critical-pair/completion procedure
• Relational Methods in Computer Science
• KBCV – Knuth-Bendix Completion Visualizer
• A strategy to deal with divergent rewrite systems
• Citius altius fortius: lessons learned from the theorem prover Waldmeister

This page was built for publication:

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