D.W. Reed, D.W. Loveland, and B.T. Smith. A near-Horn approach to disjunctive logic programming. In Proc. of the Second Workshop on Extensions of Logic Programming (ELP '91). Lecture Notes in Artificial Intelligence 596, pages 345--369. Springer-Verlag, Berlin, 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Computing Minimal Models - Ben-Eliyahu, Dechter (1993) (1 citation) (Correct)
....MinSAT presented in Section 4.1, will be effective for deductive database having only few disjunctive rules. Indeed, it is likely that only a small fraction of the database will consist of disjunctive rules, since these rules are quite expressive and are saved for rare occasions (see also [RLS92]) Acyclic networks and almost tree networks are likely to appear when the knowledge is relatively sparse or specially structured. Areas like modelbased circuit diagnosis or knowledge bases involving temporal information like planning and scheduling, are likely candidates. For instance, it was ....
David W. Reed, Donald W. Loveland, and Bruce T. Smith. The near-horn approach to disjunctive logic programming. In Proceedings of the 2nd workshop on extensions of logic programming, Lecture Notes in Artificial Intelligence Vol. 596. Springer-Verlag, 1992.
SATCHMORE: SATCHMO with RElevancy - Loveland, Reed, Wilson (1995) (17 citations) Self-citation (Reed Loveland) (Correct)
....the field of Disjunctive Logic Programming. See [LMR92] for a general presentation of this area. For the reasons mentioned here regarding relevancy, most procedures suggested for this extension of logic programming are basically top down. One such example is our near Horn Prolog procedure (see [RLS92] for an overview) that is very closely related to Prolog. The potential gain of SATCHMORE like procedures is that data driven ( bottom up ) procedures can result in less computation time due to the reuse of intermediate results. The strong relevancy mechanism introduced here provides the needed ....
D.W. Reed, D.W. Loveland, and B.T. Smith. A near-Horn approach to disjunctive logic programming. In Proc. of the Second Workshop on Extensions of Logic Programming (ELP '91). Lecture Notes in Artificial Intelligence 596, pages 345--369. Springer-Verlag, Berlin, 1992.
A Case-Analysis Approach To Disjunctive Logic Programming - Reed (1991) (1 citation) Self-citation (Reed Loveland) (Correct)
....a procedure which naturally extends SLD resolution Prolog to disjunctive programs using case analysis. Since the late 1980 s, many researchers have been addressing the semantics of disjunctive programs, including Minker and his students [LMR89, MR90, RM90, Lob90, MRL91] Loveland, Reed, and Smith [LR91, RLS91a, RLS91b], and Przymusinski [Prz90] 24 2.2 Horn Logic Programming As we have seen, the idea of reasoning from logical statements in a systematic, mechanical way was not new to the field of logic programming. Mathematical logic had considered systematic deduction since antiquity, and automated theorem ....
D.W. Reed, D.W. Loveland, and B.T. Smith. A near-Horn approach to disjunctive logic programming. In Proc. of the Second Workshop on Extensions of Logic Programming, 1991. To appear in Lecture Notes in Computer Science.
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