Advertisement
Published in:
2008 | OriginalPaper | Chapter
Removing Redundancy from Answer Set Programs
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.