Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computer Aided Systems Theory

EUROCAST 1997: Computer Aided Systems Theory — EUROCAST'97 pp 236–251Cite as

A numerical computation for declarative expressions

  • 2 Theory and Methods
  • Conference paper
  • First Online:

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

Abstract

Theory and techniques allowing the inference of precise declarations from a multivalued table are developed. The concepts of cartesian subuniverse and cartesian cosubuniverse are presented, together with a symbolic notation that allows the expression of definitions and theorems in compact array and coarray form. This symbolic notation also provides straight forward computational techniques to deal efficiently with the involved inductive or deductive calculi.

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. G. Fiol, J. Mire Nicolau and J. Miro-Julia. A New Perspective in the Inductive Acquisition of Knowledge from Examples. In Lecture Notes of Computer Science, 682, pages 219–228,1992.

    Google Scholar 

  2. R.S.Michalski, I.Mozetic,J. Hong and N. Lavrac The Multi-purpose incremental system AQ15 and its testing application to three medical domains. In Proc. of the American Association for AI Conference, Philadelphia, 1986.

    Google Scholar 

  3. J. Mire, and M. Miro-Julia. Equality of Functions in CAST. In Proceedings of the Fifth International Workshop on Computer Aided Systems Theory-EUROCAST-95, pages 129–136, 1995.

    Google Scholar 

  4. Z. Pawlak. Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publisher, 1991.

    Google Scholar 

  5. J.R. Quinlan. Induction of Decision Trees. Machine Learning, 1:81–106,1986.

    Google Scholar 

  6. R. Wille. Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival, editor, Ordered Sets, pages 445–470. Reidel, Dordrecht, Boston, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universitat de les Illes Balears, 07071, Palma de Mallorca, Spain

    Josep Miro & Margaret Miro-Julia

Authors
  1. Josep Miro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Margaret Miro-Julia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz Pichler Roberto Moreno-Díaz

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miro, J., Miro-Julia, M. (1997). A numerical computation for declarative expressions. In: Pichler, F., Moreno-Díaz, R. (eds) Computer Aided Systems Theory — EUROCAST'97. EUROCAST 1997. Lecture Notes in Computer Science, vol 1333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025047

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63811-7

  • Online ISBN: 978-3-540-69651-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation