Renaming a set of non-Horn clauses

DOI10.1007/BF02950403zbMath0961.68126MaRDI QIDQ1587332

Qing Guo, Xumin Nie

Publication date: 20 November 2000

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

logic programmingProlognon-Horn clauses

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Near-Horn prolog and beyond
• Non-Horn clause logic programming without contrapositives
• A simplified problem reduction format
• Non-Horn clause logic programming
• Near-Horn Prolog and the ancestry family of procedures
• A comparison of three PROLOG extensions
• Unit Refutations and Horn Sets
• Renaming a Set of Clauses as a Horn Set
• A Simplified Format for the Model Elimination Theorem-Proving Procedure