Abstract
The focus of this paper lies on the proof-theory for extensions of Logic Programming in which it is possible to draw negative conclusions both in a direct (i.e., based on a proof) and in an indirect (i.e., based on the lack of a proof) way. These extensions are provided with a rule-based deductive system in the sense of the work of Jäger [4] for Normal Logic Programs. Rule-based deductive systems can be used as a powerful tool to study the structural properties of the logic programming languages. Furthermore, in the deductive systems the fundamental semantical properties of the languages can be formalised by proof-rules of the systems. Therefore, different extensions of logic programming can be compared by comparing their deductive systems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt and R.N. Bol. Logic programming and negation: a survey. Technical Report Report CS-R9402, January 1994.
N.D. Belnap. A useful four-valued logic. In J.M. Dunn and G. Epstein, editors, Modern uses of Multiple-valued Logic, pages 8–37. D. Reidel Publishing Company, 1977. Dordrecht.
M. Gelfond and V. Lifschitz. Logic programs with classical negation. In D.H.D. Warren and P. Szeredi, editors, 7th International Conference on Logic Programming, pages 579–597. MIT Press, 1990.
G. Jäger. A deductive approach to logic programming. In H. Schwichtenberg, editor, Proof and Computation, pages 133–172. 1994. Series F: Computer and Systems Sciences, NATO Advanced Study Institute.
G. Jäger and R. Stärk. A proof-theoretic framework for logic programming. In S. Buss, editor, Handbook of Proof Theory. To appear.
C.M. Jonker. Constraints and Negations in Logic Programming. PhD thesis, Dept. of Philosophy, Utrecht University, 1994. Quaestiones Infinitæ vol. 10, Dissertation.
C.M. Jonker. Rule-based calculi for extensions of logic programming. Technical Report IAM 95-006, Institut für Informatik und angewandte Mathematik, Universität Bern, 1995.
R.A. Kowalski and F. Sadri. Logic programs with exceptions. In D.H.D. Warren and P. Szeredi, editors, Logic Programming, Proceedings 7th International Conference, pages 598–613. MIT Press, 1990.
K. Kunen. Signed data dependencies in logic programs. Journal of Logic Programming, 7:231–245, 1989.
V. Marek and M. Truszczyński. Nonmonotonic logic. Springer Verlag Heidelberg, 1993.
J. Minker and C. Ruiz. Semantics for disjunctive logic programs with explicit and default negation. Fundamenta Informaticae, 20:145–192, 1994.
L.M. Pereira and J.J. Alferes. Well founded semantics for logic programs with explicit negation. In B. Neumann, editor, Proceedings 10th European Conference on Artificial Intelligence, ECAI'92, pages 102–106, 1992.
T.C. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 1994.
K. Schütte. Proof Theory. Springer, 1977.
G. Wagner. A database needs two kinds of negation. In B. Thalheim, J. Demetrovics, and H.D. Gerhardt, editors, MFDBS 91, volume 495 of Lecture Notes in Computer Science, pages 357–371. Springer-Verlag, 1991.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag
About this paper
Cite this paper
Jonker, C.M. (1996). Proof-theory for extensions of Logic Programming. In: Dyckhoff, R., Herre, H., Schroeder-Heister, P. (eds) Extensions of Logic Programming. ELP 1996. Lecture Notes in Computer Science, vol 1050. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60983-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-60983-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60983-4
Online ISBN: 978-3-540-49751-6
eBook Packages: Springer Book Archive