Abstract
In the field of logic languages, we try to reconcile the proof theoretic tradition, characterized by the concept of uniform proof, with the classic approach based on fixpoint semantics. Hence, we propose a treatment of sequent calculi similar in spirit to the treatment of Horn clauses in logic programming. We have three different semantic styles (operational, declarative, fixpoint) that agree on the set of all the proofs for a given calculus. Following the guideline of abstract interpretation, it is possible to define abstractions of the concrete semantics, which model well known observables such as correct answers or groundness. This should simplify the process of extending important results obtained in the case of positive logic programs to the new logic languages developed by proof theoretic methods. As an example of application, we present a top-down static analyzer for properties of groundness which works for full intuitionistic first order logic.
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
Amato, G.: Uniform Proofs and Fixpoint Semantics of Sequent Calculi. DRAFT (1999), Available at the following http://www.di.unipi.it/~amato/papers/
Amato, G., Levi, G.: Properties of the lattice of observables in logic programming. In: Falaschi, M., Navarro, M. (eds.) Proceedings of the APPIAGULP- PRODE 1997 Joint Conference on Declarative Programming (1997)
Andreoli, J.M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2(3), 297–347 (1992)
Armstrong, T., Marriott, K., Schachte, P., Søndergaard, H.: Boolean functions for dependency analysis: Algebraic properties and efficient representation. In: Le Charlier, B. (ed.) SAS 1994. LNCS, vol. 864, pp. 266–280. Springer, Heidelberg (1994)
Bossi, A., Gabbrielli, M., Levi, G., Meo, M.C.: A Compositional Semantics for Logic Programs. Theoretical Computer Science 122(1–2), 3–47 (1994)
Brogi, A., Mancarella, P., Pedreschi, D., Turini, F.: Modular logic programming. ACM Transactions on Programming Languages and Systems 16(4), 1361–1398 (1994)
Comini, M., Levi, G., Meo, M.C.: A theory of observables for logic programs. Information and Computation (1999) (to appear)
Comini, M., Levi, G., Vitiello, G.: Modular abstract diagnosis. In: International Workshop on Tools and Environments for (Constraint) Logic Programming (1997)
Comini, M., Meo, M.C.: Compositionality properties of SLD-derivations. Theoretical Computer Science 211(1&2), 275–309 (1999)
Cortesi, A., Filè, G., Winsborough, W.: Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis. In: Proc. Sixth IEEE Symp. on Logic In Computer Science, pp. 322–327. IEEE Computer Society Press, Los Alamitos (1991)
Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Proc. Fourth ACM Symp. Principles of Programming Languages, pp. 238–252 (1977)
Cousot, P., Cousot, R.: Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming 13(2&3), 103–179 (1992)
Debray, S.K.: Formal bases for dataflow analysis of logic programs. In: Levi, G. (ed.) Advances in logic programming theory, pp. 115–182. Clarendon Press, Oxford (1994)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)
Malésieux, F., Ridoux, O., Boizumault, P.: Abstract compilation of λProlog. In: Jaffar, J. (ed.) Joint International Conference and Symposium on Logic Programming, Manchester, United Kingdom, June 1998, pp. 130–144. MIT Press, Cambridge (1998)
Marriott, K., Sondergaard, H.: Abstract Interpretation of Logic Programs: the Denotational Approach. In: Bossi, A. (ed.) Proc. Fifth Italian Conference on Logic Programming, pp. 399–425 (1990)
Miller, D., Pfenning, F., Nadathur, G., Scedrov, A.: Uniform proofs as a foundation for Logic Programming. Annals of Pure and Applied Logic 51, 125–157 (1991)
Möller, B.: On the Algebraic Specification of Infinite Objects – Ordered and Cntinuous Models of Algebraic Types. Acta Informatica 22, 537–578 (1985)
Nadathur, G., Miller, D.: An Overview of λProlog. In: Bowen, K.A., Kowalski, R.A. (eds.) Fifth International Logic Programmiong Conference, pp. 810–827. MIT Press, Cambridge (1988)
Volpe, P.: Abstractions of uniform proofs. In: Hanus, M., Rodriguez-Artalejo, M. (eds.) ALP 1996. LNCS, vol. 1139, pp. 224–237. Springer, Heidelberg (1996)
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
Amato, G., Levi, G. (2000). Abstract Interpretation Based Semantics of Sequent Calculi. In: Palsberg, J. (eds) Static Analysis. SAS 2000. Lecture Notes in Computer Science, vol 1824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45099-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-45099-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67668-3
Online ISBN: 978-3-540-45099-3
eBook Packages: Springer Book Archive