D.W. Reed. A Case-analysis Approach to Disjunctive Logic Programming. PhD thesis, Duke University, December 1991. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Proof Procedures for Logic Programming - Donald W. Loveland, Gopalan.. (1994) (5 citations) (Correct)
....Disjunctive Logic Programming) with a first book devoted to the subarea (see [LMR92] Our focus is on proof procedures so we restrict ourselves to presenting (one version of) the Near Horn Prolog (nH Prolog) procedure mentioned earlier. This version of nH Prolog was developed by Reed and Loveland [Ree88, Ree91, LR91] based on earlier versions devised by Loveland [Lov87, Lov91] The astute reader may recognize that the introduction of non Horn clauses such as above returns us to the full descriptive power of first order logic since every clause in a conjunctive normal form (cnf) presentation of a formula can ....
D.W. Reed. A Case-analysis Approach to Disjunctive Logic Programming. PhD thesis, Duke University, December 1991.
The Near-Horn Approach to Disjunctive Logic Programming - David Reed (1992) (1 citation) Self-citation (Reed) (Correct)
....reading of disjunctive logic programs. The nH Prolog procedures provide efficient and intuitive procedural semantics which extend the standard Horn semantics. As for declarative semantics, we have developed a fixpoint characterization of disjunctive logic programs which is based on case analysis [RLS91, Ree91]. This characterization agrees with the standard minimal model state semantics of Minker, Lobo, and Rajasekar as well as their fixpoint characterization [LMR89, MR90] but has the advantage that it generalizes the well understood fixpoint semantics of Horn programs following the simple ....
....the case. We thus say that InH Prolog has a local procedural reading. 3 Semantics The second facet of the near Horn Prolog project has focused on the semantics of disjunctive logic programs from a case analysis approach. A fixpoint characterization of disjunctive programs has been developed [RLS91, Ree91] which generalizes the standard Horn program characterization [vEK76] and agrees with the fixpoint characterization of Minker, Lobo, and Rajasekar [LMR89, MR90] In addition, this characterization matches the nH Prolog procedures (InH Prolog in particular) and so provides insight into the workings ....
[Article contains additional citation context not shown here]
D.W. Reed. A Case-analysis Approach to Disjunctive Logic Programming. PhD thesis, Duke University, December 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC