Abstract
We define the stable semantics for general hypothetical logic programs. We consider resolving a hypothetical goal (G ∶ R) in a context P as consisting of two steps: (i) Updating the context by inserting the clauses in R into it, and (ii) Resolving the goal G wrt the new context P U R. The consequence of viewing the assumptions R in a hypothetical goal (G ∶ R) as an update request imposes a kind of update semantics on the semantics of P. We study this problem and introduce the rational semantics for hypothetical programs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bonner A.J., McCarty L.T. ‘Adding negation as failure to intuitionistic logic programming’ In Proceedings of North American Conference on Logic programming, 1990, MIT Press
Brogi A., Lamma E., Mello P. ‘A general framework for structuring logic programs’ Technical report March 1990, DEIS, University of Bologna
Dung P.M. ‘Negations as hypotheses: An abductive foundation for logic programming’ In Proceedings of the Eighth International Conference on Logic programming, June 1991, Paris, France
Fagin R., Kuper G.M., Ullman J.D., Vardi M.Y ‘Updating logical databases’ Advances in Computing research, Vol 3, pp 1–18
Gabbay D.M., Reyle U. ‘N-Prolog: an extension of prolog with hypothetical implications’ J. logic programming 4, 1984
Gelfond M., Lifschitz V. ‘The stable model semantics for logic programs’ Proceedings of Fifth Int. Conf. and Symp. on LP, 1988
Van Gelder A., Ross K., Schlipf J.S. ‘Unfounded set and well-founded semantics for general logic programs’ in Proc. of PODS 1988
Harland, J. 'success and Failure for Hereditary Harrop Formulae’ Technical Report 91/17, Department of Computer Science, University of Melbourne
Kowalski R.A. ‘Logic for problem solving’ Elsevier North Holland, New York, 1979
Kakas T., Mancarella P. ‘Stable theories of logic programs’ Proc. of UPS 1991, Nov 1991, USA, MIT Press
Miller, D. ‘Logical Analysis of Modules in Logic Programming’ J. Logic Programming, 1989: 79–108
Monteiro L, Porto A. ‘Contextual logic programming’ Proc. of Sixth ICLP, 1989, MIT Press
Przymusinski T.C. ‘On the declarative semantics of deductive databases and logic programs’ in Foundation of Deductive databases and Logic programming, J. Minker (ed.), 1988
Pereira L.M., Alferes J.L., Aparicio J.N ‘Contradiction Removal Within Well-founded Semantics’ Proc. of the first Intern. Workshop on Logic programming and Nonmonotonic Logic, Washington, June 1991, MIT Press
Sacca D., Zaniolo C. ‘Partial Models and three-Valued Models in Logic programs with Negation’ Proc. of the first Intern. Workshop on Logic programming and Nonmonotonic Logic, Washington, June 1991, MIT Press
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dung, P.M. (1993). Declarative semantics of hypothetical logic programming with negation as failure. In: Lamma, E., Mello, P. (eds) Extensions of Logic Programming. ELP 1992. Lecture Notes in Computer Science, vol 660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56454-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-56454-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56454-6
Online ISBN: 978-3-540-47562-0
eBook Packages: Springer Book Archive