Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt and R. Bol. Logic programming and negation: a survey. JLP 19, 20:9–71, 1994.
A. Bertoni, G. Mauri and P. Miglioli. On the power of model theory in specifying abstract data types and in capturing their recursiveness. Fundamenta Informaticae VI(2):127–170, 1983.
A. Bossi, M. Gabbrielli, G. Levi and M.C. Meo. A compositional semantics for logic programs. TCS 122:3–47, 1994.
A. Brogi, P. Mancarella, D. Pedreschi and F. Turini. Modular logic programming. ACM TOPLAS 16(4):1361–1398, 1994.
M. Bugliesi, E. Lamma and P. Mello. Modularity in logic programming. JLP 19, 20:443–502, 1994.
D. Chan. Constructive negation based on the completed database. In Proc. JIC-SLP’88, pages 111–125, MIT Press, 1988.
D. De Schreye and S. Decorte. Termination of logic programs: The never-ending story. JLP 19, 20:199–260, 1994.
M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365–385, 1991.
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.
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.
K.-K. Lau, M. Ornaghi, and S.-Å. Tärnlund. Steadfast logic programs. JLP 38(3):259–294, 1999.
J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1987.
P. Lucio, F. Orejas, and E. Pino. An algebraic framework for the definition of compositional semantics of normal logic programs. JLP 40:89–123, 1999.
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.
P. Miglioli, U. Moscato and M. Ornaghi. Abstract parametric classes and abstract data types defined by classical and constructive logical methods. J. Symb. Comp. 18:41–81, 1994.
R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322, Plenum Press, 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lau, KK., Ornaghi, M. (2000). Isoinitial Semantics for Logic Programs. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_15
Download citation
DOI: https://doi.org/10.1007/3-540-44957-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67797-0
Online ISBN: 978-3-540-44957-7
eBook Packages: Springer Book Archive