We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Volume 15 Issue 5
September  2000
NIE Xumin, GUO Qing. Renaming a Set of Non-Horn Clauses[J]. Journal of Computer Science and Technology, 2000, 15(5): 409-415.
Citation: NIE Xumin, GUO Qing. Renaming a Set of Non-Horn Clauses[J]. Journal of Computer Science and Technology, 2000, 15(5): 409-415.

Renaming a Set of Non-Horn Clauses

More Information
  • Published Date: September 09, 2000
  • Several extensions of the logic programming language Prolog to non Horn clauses use case analysis to handle non-Horn clauses. In this paper, analytical and empirical evidences are presented to show that, by making a set of clauses less "non-Horn" using predicate renaming, the performance of these case-analysis based procedures can be improved significantly. In addition, the paper also investigated the problem of efficiently constructing a predicate renaming that reduces the degree of "non-Hornness" of a c…
  • [1]
    Clocksin W F, Mellish C S. Programming in Prolog. Springer-Verlag, 1981.
    [2]
    Lloyd J W. Foundations of Logic Programming. Springer-Verlag, 1987.
    [3]
    Kowalski R A. Predicate logic as a programming language. In Information Processing 74, Jack Rosenfeld (ed.), North-Holland, 1974, pp.569-574. ……….

Catalog

    Article views (13) PDF downloads (1484) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return