On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Journal of the ACM (JACM)
Handbook of theoretical computer science (vol. B)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the eleventh international conference on Logic programming
Fully abstract compositional semantics for an algebra of logic programs
Theoretical Computer Science
A unifying view for logic programming with non-monotonic reasoning
Theoretical Computer Science
Compositionality of normal open logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Composing General Logic Programs
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Hi-index | 0.01 |
Most modern computing systems consist of large numbers of software components that interact with each other. Correspondingly, the capability of re-using and composing existing software components is of primary importance in this scenario. In this paper we analyse the role of renaming as a key ingredient of component-based programming. More precisely, a meta-level renaming operation is introduced in the context of a logic-based program composition setting which features a number of other composition operations over general logic programs, that is, logic programs possibly containing negative premises. Several examples are presented to illustrate the increased knowledge representation capabilities of logic programming for non-monotonic reasoning. The semantics of programs and program compositions is defined in terms of three-valued logic by extending the three-valued semantics for logic programs proposed by Fitting [10]. A computational interpretation of program compositions is formalised by means of an equivalence preserving transformation of arbitrary program compositions into standard general programs.