Verifying the Equivalence of Logic Programs in the Disjunctive Case

Abstract

• We consider (weak) equivalence of disjunctive logic programs. • We have previously developed an automated translation-based method for verifying the equivalence of programs supported by the smodels system. • P ≡s Q =⇒ P ≡ Q (by setting R = ∅), but P ≡ Q 6=⇒ P ≡s Q. • Whether P ≡ Q holds, remains open whenever P 6≡s Q holds =⇒ Verifying P ≡ Q remains as a… (More)
DOI: 10.1007/978-3-540-24609-1_17

Topics

Cite this paper

@inproceedings{Oikarinen2004VerifyingTE, title={Verifying the Equivalence of Logic Programs in the Disjunctive Case}, author={Emilia Oikarinen and Tomi Janhunen}, booktitle={LPNMR}, year={2004} }