The Near-Horn Approach to Disjunctive Logic Programming

This paper presents an overview of the near-Horn Prolog project at Duke University. The basic goal behind this project has been to extend Prolog to disjunctive logic programs (and thus full first-order expressibility) while retaining as much of the clarity and procedural simplicity of Prolog as possible. The approach taken to achieve this goal has been to combine Prolog with case analysis reasoning. The research work within the project can roughly be divided into three areas: procedure design, semantics, and implementation. Three different variants of Near-Horn Prolog have been devised, of which the most recent, Inheritance near-Horn Prolog (InH-Prolog), is the variant currently being favored. The semantics for the near-Horn Prologs, specifically for InH-Prolog, have been investigated, resulting in a case-analysis based fixpoint semantics which mimics the procedural behavior of InH-Prolog. Also, both classical and default negation have been incorporated into the near-Horn Prolog systems. Finally, an interpreter for the original near-Horn Prolog variant has been implemented, and a compiler for the InH-Prolog variant is currently nearing completion.

[1]  Robert A. Kowalski,et al.  Linear Resolution with Selection Function , 1971, Artif. Intell..

[2]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[3]  W D Reed,et al.  A case-analysis approach to disjunctive logic programming , 1992 .

[4]  R. Kowalski,et al.  Linear Resolution with Selection Function , 1971 .

[5]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[6]  Donald W. Loveland,et al.  Near-Horn PROLOG , 1987, ICLP.

[7]  Donald W. Loveland,et al.  A Simple Near-Horn Prolog Interpreter , 1988, ICLP/SLP.

[8]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[9]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[10]  David W. Reed,et al.  A Near-Horn Prolog for Compilation , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[11]  Jack Minker,et al.  A Fixpoint Semantics for Disjunctive Logic Programs , 1990, J. Log. Program..

[12]  David W. Reed,et al.  An Alternative Characterization of Disjunctive Logic Programs , 1991, ISLP.

[13]  Gerhard Gentzen,et al.  Investigations into Logical Deduction , 1970 .

[14]  Jorge Lobo,et al.  Extending the Semantics of Logic Programs to Disjunctive Logic Programs , 1989, ICLP.

[15]  Donald W. Loveland,et al.  A Simplified Format for the Model Elimination Theorem-Proving Procedure , 1969, J. ACM.

[16]  Donald W. Loveland,et al.  Mechanical Theorem-Proving by Model Elimination , 1968, JACM.

[17]  Jack Minker,et al.  An Extension to Linear Resolution with Selection Function , 1982, Inf. Process. Lett..

[18]  David W. Reed,et al.  A Comparison of Three Prolog Extensions , 1992, J. Log. Program..