A sufficient condition for strong equivalence under the well-founded semantics

Authors:
Christos Nomikos;Panos Rondogiannis;William W. Wadge
Affiliations:
Department of Computer Science, University of Ioannina, Ioannina, Greece;Department of Informatics & Telecommunications, University of Athens, Panepistimiopolis, Athens, Greece;Department of Computer Science, University of Victoria, Victoria, BC, Canada
Venue:
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Year:
2005

Citing 2
Cited 1

Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Minimum model semantics for logic programs with negation-as-failure

ACM Transactions on Computational Logic (TOCL)

Strong equivalence of logic programs under the infinite-valued semantics

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of strong equivalence [1] under the infinite-valued semantics [2] (which is a purely model-theoretic version of the well-founded semantics). We demonstrate that two programs are now strongly equivalent if and only if they are logically equivalent under the infinite-valued logic of [2]. In particular, we show that for propositional programs strong equivalence is decidable but coNP-complete. Our results have a direct practical implication for the well-founded semantics since, as we demonstrate, if two programs are strongly equivalent under the infinite-valued semantics, then they are also strongly equivalent under the well-founded semantics.