Abstract
Standard software and knowledge engineering best practices advise for modularity because, amongst other benefits, it facilitates development, debugging, maintenance, composition and interoperability. Knowledge bases written as Logic Programs are no exception, and their corresponding semantics should enable such modularity. In this paper we formally define several new syntactical notions and semantics properties that capture the notions of modularity and separation of concerns applied to the LPs domain. Furthermore, we set forth other notions necessary for top-down, call-graph oriented existential query answering with 2-valued semantics for LPs with Integrity Constraints.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Costantini, S., Lanzarone, G.A., Magliocco, G.: Layer supported models of logic programs. In: Maher, M. (ed.) Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming (JICSLP 1996), pp. 438–452. MIT Press. Cambridge, USA (1996)
Dix, J.: A classification theory of semantics of normal logic programs: I. strong properties. Fundam. Inform. 22(3), 227–255 (1995)
Dix, J.: A classification theory of semantics of normal logic programs: II. weak properties. Fundam. Inform. 22(3), 257–288 (1995)
Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 620–650 (1991)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP/SLP, pp. 1070–1080. MIT Press (1988)
Papazoglou, M., Yang, J.: Design methodology for web services and business processes. Technol. E-Serv. 2444, 175–233 (2002)
Pereira, L.M., Aparicio, J.N., Alferes, J.J.: Hypothetical reasoning with well founded semantics. In: Mayoh, B. (ed.) Scandinavian Conference on Artificial Intelligence: Proceedings of the SCAI 1991, pp. 289–300. IOS Press, Amsterdam (1991)
Sommerville, I.: Software Engineering 9. Pearson Education, London (2011)
Acknowledgements
L.M.P. is supported by NOVA LINCS (UIDB/04516/2020) with the financial support of FCT- Fundação para a Ciência e a Tecnologia, Portugal, through national funds.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Pinto, A.M., Pereira, L.M. (2023). Modularization of Logic Programs. In: Lopez-Garcia, P., Gallagher, J.P., Giacobazzi, R. (eds) Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems. Lecture Notes in Computer Science, vol 13160. Springer, Cham. https://doi.org/10.1007/978-3-031-31476-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-031-31476-6_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-31475-9
Online ISBN: 978-3-031-31476-6
eBook Packages: Computer ScienceComputer Science (R0)