Abstract
This paper introduces a restricted form of the axiom rule in calculi of Partial Inductive Definitions (PID). The paper argues that in calculi of PIDs the distinction between atomic and non-atomic formulae is not as clear as in traditional sequent calculi. Therefore the common restriction of the axiom rule to the atomic case is not adequate for this type of calculi.
A novel proviso for the axiom rule and corresponding provisos for the left and right definition rules are introduced with an accompanying discussion and suggestions for possible applications in the domain of declarative specification of operational behaviour of logic programs.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Hallnäs, L. “Partial Inductive Definitions”, Theoretical Computer Science vol. 87(1) 1991 pp. 115–142.
Hallnäs, L., Schroeder-Heister, P. “A Proof Theoretic Approach to Logic Programming”, Journal of Logic and Computation vol. 1(2) 1990 pp. 261–283 and vol. 1(5) 1991 pp. 635–660.
Kreuger, P. “GCLA II—A definitional approach to control”, SICS Research Report R92:09, Swedish Institute of Computer Science, Stockholm 1992. Also published (minus some minor additions and corrections) as Lic. Dissertation — Dept. of Computer Science, Chalmers University of Technology, Göteborg 1990 and in [11] pp. 239–297.
Kleene S. C. “Introduction to Metamathematics”, North-Holland 1952 pp. 442–448.
Schroeder-Heister, P. “Structural Frameworks, substructural logics and the role of elimination inferences”, in Plotkin, G., Huet, G. (Eds.), “Logical Frameworks”. Cambridge University Press 1991 pp. 385–403.
Girard J.-Y., “Linear Logic”, in Theoretical Computer Science Vol. 50(1), 1987 pp. 1–102.
Aronsson, M., “Implementational Issues in GCLA — A-sufficiency and the Definiens Operation”, in [12] pp. 394–417.
Aronsson, M., Eriksson, L-H., Gäredal, A., Hallnäs, L., Olin, P. “The Programming Language GCLA: A Definitional Approach to Logic Programming” New Generation Computing vol. 7(4) 1990 pp. 381–404.
Aronsson, M. “A Definitional Approach to the Combination of Functional and Relational Programming”, SICS Research Report R91:10, Swedish Institute of Computer Science, Stockholm 1991.
Schroeder-Heister, P. (Ed.) “Extensions of Logic Programming, International Workshop, Tübingen, FRG, December 1989, Proceedings”, Springer Lecture Notes in Artificial Intelligence 475, Springer-Verlag 1991.
Eriksson, L-H; Hallnäs, L; Schroeder-Heister, P. (Eds.) “Extensions of Logic Programming—ELP 91”, in “Extensions of Logic Programming, Second International Workshop, ELP'91, Stockholm, Sweden, January 1991, Proceedings”, Springer Lecture Notes in Artificial Intelligence 596, Springer-Verlag 1992.
Lamma, E., Mello, P. (Eds.) “Extensions of Logic Programming, Third International Workshop, ELP'92, Stockholm, Sweden, February 1992, Proceedings”, Springer Lecture Notes in Artificial Intelligence 660, Springer-Verlag 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kreuger, P. (1994). Axioms in definitional calculi. In: Dyckhoff, R. (eds) Extensions of Logic Programming. ELP 1993. Lecture Notes in Computer Science, vol 798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58025-5_57
Download citation
DOI: https://doi.org/10.1007/3-540-58025-5_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58025-6
Online ISBN: 978-3-540-48417-2
eBook Packages: Springer Book Archive