Foundations of Logic Programming in Hybridised Logics
The present paper sets the foundation of logic programming in hybridised logics. The basic logic programming semantic concepts such as query and solutions, and the fundamental results such as the existence of initial models and Herbrand’s theorem, are developed over a very general hybrid logical system. We employ the hybridisation process proposed by Diaconescu over an arbitrary logical system captured as an institution to define the logic programming framework.
- 8.Goguen, J.A., Thatcher, J.W.: Initial algebra semantics. In: SWAT (FOCS), pp. 63–77. IEEE Computer Society (1974)Google Scholar