Skip to main content Accessibility help
×
Home

First-order modular logic programs and their conservative extensions

  • AMELIA HARRISON (a1) and YULIYA LIERLER (a2)

Abstract

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.

Copyright

References

Hide All
Buddenhagen, M. and Lierler, Y. (2015). Performance tuning in answer set programming. In Logic Programming and Nonmonotonic Reasoning - 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27–30, 2015. Proceedings, 186–198.
Denecker, M., Lierler, Y., Truszczynski, M. and Vennekens, J. (2012). A Tarskian informal semantics for answer set programming. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12), LIPIcs, 17, 277–289.
Faber, W., Leone, N., Mateis, C. and Pfeifer, G. (1999). Using database optimization techniques for nonmonotonic reasoning, 135–139.
Ferraris, P. (2005). Answer sets for propositional theories. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 119–131.
Ferraris, P., Lee, J. and Lifschitz, V. (2011). Stable models and circumscription. Artificial Intelligence, 175, 236263.
Ferraris, P., Lee, J., Lifschitz, V. and Palla, R. (2009). Symmetric splitting in the general theory of stable models. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 797–803.
Ferraris, P. and Lifschitz, V. (2005). Weight constraints as nested expressions. Theory and Practice of Logic Programming 5, 1–2, 4574.
Lierler, Y. and Truszczyński, M. (2013). Modular answer set solving. In Proceedings of the 27th AAAI Conference on Artificial Intelligence.
Lifschitz, V. (2002). Answer set programming and plan generation. Artificial Intelligence 138, 3954.
Lifschitz, V., Pearce, D. and Valverde, A. (2001). Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 526541.
Lifschitz, V., Pearce, D. and Valverde, A. (2007). A characterization of strong equivalence for logic programs with variables. In Procedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 188–200.
Oikarinen, E. and Janhunen, T. (2008). Achieving compositionality of the stable model semantics for Smodels programs. Theory and Practice of Logic Programming 5–6, 717761.
Wang, Y., Zhang, Y., Zhou, Y. and Zhang, M. (2014). Knowledge forgetting in answer set programming. Journal of Artificial Intelligence Research 50 1, 3170.

First-order modular logic programs and their conservative extensions

  • AMELIA HARRISON (a1) and YULIYA LIERLER (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed