1 research outputs found
Strong Equivalence and Program's Structure in Arguing Essential Equivalence between Logic Programs
Answer set programming is a prominent declarative programming paradigm used
in formulating combinatorial search problems and implementing distinct
knowledge representation formalisms. It is common that several related and yet
substantially different answer set programs exist for a given problem.
Sometimes these encodings may display significantly different performance.
Uncovering {\em precise formal} links between these programs is often important
and yet far from trivial. This paper claims the correctness of a number of
interesting program rewritings