scientific article; zbMATH DE number 1090102

MaRDI QIDQ4366603zbMATH OpenFDO

Authors Xumin Nie, Qing Guo

Publication date 21 September 1998

zbMATH Keywords

renamingHorn clausesmeasure for being non-Horn

Mathematics Subject Classification ID

Logic programming (68N17) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70)

Recommendations

• Renaming a set of non-Horn clauses
• scientific article; zbMATH DE number 3892614
• On renaming a set of clauses as a Horn set
• A linear algorithm for renaming a set of clauses as a Horn set
• Minimizing the number of clauses by renaming

Cited in

(10)

• Parsing as non-Horn deduction
• On renaming a set of clauses as a Horn set
• scientific article; zbMATH DE number 3892614 (Why is no real title available?)
• Minimizing the number of clauses by renaming
• Non-Horn clause logic programming
• Renaming a set of non-Horn clauses
• A linear algorithm for renaming a set of clauses as a Horn set
• A new combination of input and unit deductions for Horn sentences
• Theory of logic programming. An elementary introduction
• The horn basis of a set of clauses

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