Removing Redundancy from Answer Set Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of Logic Programming
Modularity aspects of disjunctive stable models
Journal of Artificial Intelligence Research
Verification tool of software requirement for network software
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
| Hi-index | 0.00 |
The goal of this article is to foster modular program development in answer set programming using a Gaifman-Shapiro-style module architecture. More specifically, a method for verifying the equivalence of logic program modules is devised and proved correct. The idea is to adapt a translation-based verification technique, which was originally devised for complete programs only, for program modules. In addition, optimization strategies are addressed in order to exploit the modular structure of programs in verification tasks. A number of experiments on verification strategies are also conducted using lpeq which implements the verification method for the smodels system. The preliminary experimental results reported in this article suggest that the modularization of equivalence verification leads to potential time savings especially if the modules involved share a common context.