Strong Equivalence Made Easy: Nested Expressions and Weight Constraints

Title: Strong Equivalence Made Easy: Nested Expressions and Weight Constraints

Research Question: How can strong equivalence be characterized and applied to logic programs with nested expressions and weight constraints?

Methodology: The study uses a characterization of strong equivalence based on concepts used in the definition of answer sets. This characterization is applicable to both nested programs and weight constraint programs.

Results: The research shows that strong equivalence can be characterized for nested programs and weight constraint programs without requiring knowledge of the logic of here-and-there. It also demonstrates that the question of strong equivalence of two weight constraint programs can be encoded in a weight constraint program, allowing for its decision using the answer set programming system smodels.

Implications: This research provides a simpler, more direct characterization of strong equivalence for logic programs with nested expressions and weight constraints. It also offers a practical method for studying equivalent transformations of these types of programs, making it easier for answer set programming systems like dlv and smodels to reason about strong equivalence.

Link to Article: https://arxiv.org/abs/0312029v1 Authors: arXiv ID: 0312029v1