Extending and implementing the stable model semantics
Artificial Intelligence
Automated Verification of Weak Equivalence within the smodels System*
Theory and Practice of Logic Programming
Redundancy in logic III: Non-monotonic reasoning
Artificial Intelligence
Modular Equivalence for Normal Logic Programs
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A Translation-based Approach to the Verification of Modular Equivalence
Journal of Logic and Computation
Extended ASP tableaux and rule redundancy in normal logic programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
| Hi-index | 0.00 |
In answer set programming, ground programs are used as intermediate representations of logic programs for which answer sets are computed. It is typical that such programs contain many redundant rules--increasing the length of the program unnecessarily. In this article, we address redundancy of rules in answer set programs, and in particular, in program modules that are used as components of programs. To this end, we provide an exact semantical characterization of redundancy and present a translation-based method for detecting redundant rules. A prototype implementation, the modular optimizer (modopt ), has been developed in the context of the smodels system. In the experimental part, we study the effects of modular optimization on lengths and run times of programs.