Embedding prioritized circumscription in logic programs

From MaRDI portal





The author presents a method for embedding \textit{prioritized circumscription} of a clausal theory into general disjunctive logic programs with negation as failure in the head. Based on this embedding the models of the circumscription are precisely captured by the stable models of a suitable program. Because of many pointers to the current literature as well as historical comments, the paper may be of special value to specialists interested in this branch of theoretical logic programming. For the entire collection see [Zbl 0951.00051].











This page was built for publication: Embedding prioritized circumscription in logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366600)