Modular logic programs provide a way of viewing logic programs as consisting of many independent, meaningful modules. This paper introduces first-order modular logic programs, which can capture the meaning of many answer set programs. We also introduce conservative extensions of such programs. This concept helps to identify strong relationships between modular programs as well as between traditional programs. We show how the notion of a conservative extension can be used to justify the common projection rewriting.

PDF

Theory and Practice of Logic Programming, Vol. 16, 5-6 (2016), pp. 755--770.

@article{harlier:iclp16, title={First-Order Modular Logic Programs and their Conservative Extensions}, author={Amelia Harrison and Yuliya Lierler}, booktitle={Proceedings of the 32nd International Conference on Logic Programming }, volume={16}, journal={Theory and Practice of Logic Programming}, number={5-6}, pages={755--770}, url="http://www.cs.utexas.edu/users/ai-lab?harlier:iclp2016", year={2016} }