Disjunctive logic programming
Abstract: "During the past several years a body of theoretical results has been developed in the field of logic programming. The book by Lloyd [Llo84] and the chapter by Apt [Apt89] present many of these theoretical results. In this paper we extend these results to disjunctive logic programming. We discuss and illustrate the semantics of Horn and disjunctive logic programs including negation. The material on disjunctive programming presented in this paper has been drawn from a series of papers written by the authors [MR90, MR88, RLM89b, LRM88, RM88, RLM89a, LMR89]."
What people are saying - Write a review
We haven't found any reviews in the usual places.
Negation as failure for disjunctive logic programming
3 other sections not shown
acyclic algorithm ancestor path ancestor proof graph answer set Artificial Intelligence assume autoepistemic logic back edge Baral belief set classical negation closed world assumption completion theory Computer Science Conf consistent constraint graph contains context contrapositive rule cycle-cutset default logic defined definition dependency graph derived disjunctive deductive databases disjunctive default disjunctive logic programs disjunctive program disjunctive theories Editors EDLP epistemic specification example extended disjunctive logic false foothold proof formula gcomp(P GCWA Gelfond goal ground atom HEDLP Herbrand lemma Lifschitz literal that appears Lobo MESON minimal model Minker NA1 proof graph NAFGPC-derivation NAFGPC-rule negated ancestor proof negation as failure negative literals node non-monotonic logic predicate completion problem Proc program clause Prolog proof procedure propositional logic propositional theory Przymusinski query Rajasekar satisfies semantics for disjunctive semantics of logic SLOC-derivation SN-rule stable model semantics subset Symp theorem tree edges true well-founded semantics world view