scientific article; zbMATH DE number 4064978

MaRDI QIDQ3798649zbMATH OpenFDO

Authors Emmanuel Kounalis, Michaël Rusinowitch

Publication date 1988

zbMATH Keywords

conditional term rewritingdecision algorithmHorn clausesHorn logicword problem

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Word problems, etc. in computability and recursion theory (03D40)

Recommendations

• scientific article; zbMATH DE number 4089521
• On word problems in Horn theories
• Decidability and complexity analysis by basic paramodulation
• scientific article; zbMATH DE number 1555187
• Schematic saturation for decision and unification problems.

Cited in

(13)

• Problem corner: Non-Horn problems
• Combinatorial Problems for Horn Clauses
• scientific article; zbMATH DE number 4089521 (Why is no real title available?)
• Canonical ground Horn theories
• Completion-time optimization of rewrite-time goal solving
• On fairness of completion-based theorem proving strategies
• The problem of Horn and Tarski
• Completion of first-order clauses with equality by strict superposition
• Completion procedures as semidecision procedures
• Schematic saturation for decision and unification problems.
• On restrictions of ordered paramodulation with simplification
• On word problems in Horn theories
• A completion procedure for conditional equations

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 Q3798649)