Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Logic in Databases

LID 1996: Logic in Databases pp 279–301Cite as

Analysis of logic-based systems

  • Conference paper
  • First Online:

  • 130 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1154))

Abstract

Model based analyses of definite logic programs are discussed in detail. A model of a program captures its properties. Analyzing different models one obtains a flexible approach for verification and optimization of logic-based systems. A uniform implementation of the core algorithms, which exploits deductive database technology, is investigated. In particular, novel algorithms for generating large models and for extracting properties from models are presented.

A significant part of this research has been done at the GMD FIRST, Berlin.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arni,N., Ong,S., Tsur,S., Zaniolo,C., LDL++: A Second Generation Deductive Database System, Technical Report, MCC Corporation, 1993.

    Google Scholar 

  2. Bossi, A., Gabbrielli, M., Levi, G., Martelli, M., The s-semantics Approach: Theory and Applications, J. Logic Programming, 19–20(1994), 149–197.

    Google Scholar 

  3. Boulanger,D., Complete Analysis for Definite Logic Programs, Proc. 11th Workshop Logische Programmierung, Technishe Universität Wien, GMD-Studien Nr.270, 1995, 101–110.

    Google Scholar 

  4. Boulanger,D., Bruynooghe,M., Index-Driven Semantics of Logic Programs, Technical Report CW211, K.U. Leuven, May,1995.

    Google Scholar 

  5. Boulanger, D., Bruynooghe, M., A Systematic Construction of Abstract Domains, Proc. 1st International Static Analysis Symposium, LNCS Vol. 864, 1994, 61–77.

    Google Scholar 

  6. Boulanger, D., Bruynooghe, M., Denecker, M., Abstracting s-semantics Using A Model-Theoretic Approach, Proc. 6th Int. Symp. on PLILP, LNCS Vol. 844, 1994, 432–446.

    Google Scholar 

  7. Bry,F., Manthey,R., Proving Finite Satisfiability of Deductive Databases, Proc. Conference Logic and Computer Science, 1987, Karlsruhe, LNCS, 1987.

    Google Scholar 

  8. Bry,F., Decker,H., Mathey,R., A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases, Proc. Extended Database Technology 1988, Venice, LNCS, 1988.

    Google Scholar 

  9. Codish, M., Demoen, B., Analyzing logic programs using “Prop”-ositional logic programs and a magic wand, J. Logic Programming, 25(1995), 249–274.

    Google Scholar 

  10. Cousot, P., Cousot, R., Abstract Interpretation and Application to Logic Programs, J. Logic Programming, 13(1992), 103–179.

    Google Scholar 

  11. Filé,G., Ranzato,F., Improving Abstract Interpretations by Systematic Lifting to the Powerset, Proc. 1994 ISLP, 1994, 655–669.

    Google Scholar 

  12. Gallagher,J., Boulanger,D., Saglam,H., Practical Model-Based Static Analysis for Definite Logic Programs, Proc. 1995 ISLP, 1995, 351–365.

    Google Scholar 

  13. Giacobazzi, R., Debray, S., Levi, G., Generalized Semantics and Abstract Interpretation for Constraint Logic Programs, J. Logic Programming, 25(1995), 191–245.

    Google Scholar 

  14. Goguen, J., Thatcher, E., Waggner, E., Wright, J., Initial Algebra Semantics and Continuous Algebras, J. ACM, 24(1977), 68–95.

    Google Scholar 

  15. Lassez,J.-L., Maher,M., Marriott,K., Unification Revisited, Foundations of Deductive Databases and Logic Programming, Morgan-Kaufmann, 1988, 587–625.

    Google Scholar 

  16. Lloyd,J., Foundations of Logic Programming, Springer, 1987.

    Google Scholar 

  17. Maher, M., Equivalence of Logic Programs, Foundations of Deductive Databases and Logic Programming, Morgan-Kaufmann, 1988, 627–658.

    Google Scholar 

  18. Marriott, K., Søndergaard, H., Precise and Efficient Groundness Analysis for Logic Programs, ACM Letters on Programming Languages, 2(1993), 181–196.

    Google Scholar 

  19. Mezei, J., Wright, J., Algebraic Automata and Context-Free Sets, Information and Control, 11(1967), 3–29.

    Google Scholar 

  20. Wirsing,W., Algebraic Specifications, in: Handbook of Theoretical Computer Science, Vol. B Formal Models and Semantics, North Holland, 1990, 678–778.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNUCE Istituto del CNR, via Santa Maria, 36, I-56126, Pisa, Italy

    Dmitri Boulanger

Authors
  1. Dmitri Boulanger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dino Pedreschi Carlo Zaniolo

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boulanger, D. (1996). Analysis of logic-based systems. In: Pedreschi, D., Zaniolo, C. (eds) Logic in Databases. LID 1996. Lecture Notes in Computer Science, vol 1154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031747

Download citation

  • DOI: https://doi.org/10.1007/BFb0031747

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61814-0

  • Online ISBN: 978-3-540-70683-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation