Renaming a set of non-Horn clauses
type: Item
instance of: scholarly article
title: Renaming a set of non-Horn clauses
zbMATH Open document ID: 0961.68126
DOI: 10.1007/BF02950403
author: Xumin Nie
author: Qing Guo
published in: Journal of Computer Science and Technology
publication date: 2000-11-20T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 1533041
zbMATH Keywords: logic programming
zbMATH Keywords: Prolog
zbMATH Keywords: non-Horn clauses
MaRDI profile type: Publication
cites work: Q3919057
cites work: Q3992908
cites work: A Simplified Format for the Model Elimination Theorem-Proving Procedure
cites work: Near-Horn prolog and beyond
cites work: A simplified problem reduction format
cites work: Non-Horn clause logic programming without contrapositives
cites work: Near-Horn Prolog and the ancestry family of procedures
cites work: Non-Horn clause logic programming
cites work: A comparison of three PROLOG extensions
cites work: Renaming a Set of Clauses as a Horn Set
cites work: Q4198056
cites work: Unit Refutations and Horn Sets
description: scientific article; zbMATH DE number 1533041