Isoinitial Semantics for Logic Programs
The Herbrand model H of a definite logic program P is an initial model among the class of all the models of P, interpreting P as an initial theory. Such a theory (program) proves (computes) only positive literals (atoms) in P, so it does not deal with negation. In this paper, we introduce isoinitial semantics for logic programs and show that it can provide a rich semantics for logic programs, which can deal with not just negation, but also incomplete information, parametricity and compositionality.
KeywordsLogic Program Logic Programming Open Program Constant Symbol Ground Atom
Unable to display preview. Download preview PDF.
- 6.D. Chan. Constructive negation based on the completed database. In Proc. JIC-SLP’88, pages 111–125, MIT Press, 1988.Google Scholar
- 7.D. De Schreye and S. Decorte. Termination of logic programs: The never-ending story. JLP 19, 20:199–260, 1994.Google Scholar
- 9.W. Hodges. Logical features of horn clauses. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson. editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 1:449–503, Oxford University Press, 1993.Google Scholar
- 10.J. Küster Filipe, K.-K. Lau, M. Ornaghi, and H. Yatsu. On dynamic aspects of OOD frameworks in component-based software development in computational logic. In Proc. LOPSTR’99, LNCS 1817:43–62, Springer-Verlag, 2000.Google Scholar
- 12.J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1987.Google Scholar
- 14.P. Miglioli, U. Moscato and M. Ornaghi. Constructive theories with abstract data types for program synthesis. In D.G. Skordev, editor, Mathematical Logic and its Applications, pages 293–302, Plenum Press, 1986.Google Scholar
- 16.R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322, Plenum Press, 1978.Google Scholar