Verifying the Equivalence of Logic Programs in the Disjunctive Case

Reference:

Emilia Oikarinen and Tomi Janhunen. Verifying the equivalence of logic programs in the disjunctive case. In V. Lifschitz and I. Niemelä, editors, Logic Programming and Nonmonotonic Reasoning, Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 2923 of Lecture Notes in Artificial Intelligence, pages 180–193, Fort Lauderdale, USA, January 2004. Springer-Verlag.

Abstract:

In this paper, we address the problem of checking whether two disjunctive logic programs possess exactly the same stable models. An existing translation-based method [Janhunen & Oikarinen, JELIA 2002], which was designed for weight constraint programs supported by the SMODELS system, is generalized to the disjunctive case. Moreover, we report on our preliminary experiments with an implementation of the method, a translator called DLPEQ.

Suggested BibTeX entry:

@inproceedings{OJ04:lpnmr,
    address = {Fort Lauderdale, USA},
    author = {Emilia Oikarinen and Tomi Janhunen},
    booktitle = {Logic Programming and Nonmonotonic Reasoning, Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning},
    editor = {V. Lifschitz and I. Niemel\"a},
    month = {January},
    pages = {180--193},
    publisher = {Springer-Verlag},
    series = {Lecture Notes in Artificial Intelligence},
    title = {Verifying the Equivalence of Logic Programs in the Disjunctive Case},
    volume = {2923},
    year = {2004},
}