Skip to main content

Data types in subdefinite models

  • Conference paper
  • First Online:
Book cover Artificial Intelligence and Symbolic Mathematical Computation (AISMC 1996)

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

Abstract

We consider the mechanism of subdefinite models and the problem of representing data types in such models. A justification of the method of subdefinite models is given; various kinds of subdefinite extensions of data types are presented. We also investigate their efficiency in the solution of various problems.

This work was partially supported by the foundation “Informatization of Russia”, grant N 285.78

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Narin'yani A.S.: Subdefinite Set — a Formal Model of Uncompletely Specified Aggregate, Proc. of the Symp. on Fuzzy Sets and Possibility Theory, Acapulco, Mexico, (1980).

    Google Scholar 

  2. Narin'yani A.S.: Subdefinite Sets — New Data Type for Knowledge Representation, Preprint USSR Acad. Sci., Siberian Division, Computer Center, 232, Novosibirsk, (1980) (in Russian).

    Google Scholar 

  3. Narin'yani A.S.: Subdefiniteness, Overdefiniteness and Absurdity in Knowledge Representation (some Algebraic Aspects), Proc. of the II Conf. on AI Application, Miamy Beach, Dec. 9–13, (1985).

    Google Scholar 

  4. Narin'yani A.S.: Subdefinite Models: a Big Jump in Knowledge Proccesing Technology, Proceeding of East-West AI Conf.: from theory to practice, Moscow, September, (1993).

    Google Scholar 

  5. Babichev A.B., et al.: UniCalc — an intelligent solver for mathematical problems, Ibid, 257–260.

    Google Scholar 

  6. Borde S.B., et al.: Subdefiniteness and Calendar Scheduling, Ibidem, 315–318.

    Google Scholar 

  7. Telerman V.V.: Propagation of Mathematical Constraints in Subdefinite Models, In: J.Calmet and J.A.Campbell (Eds.), Integrating Symbolic Mathematical Computation and Artificial Intelligence, Lect. Notes in Comp. Sci., Vol. 958, Springer, (1995), 191–208.

    Google Scholar 

  8. Mayoh B., Tyugu E., Uustalu T.: Constraint Satisfaction and Constraint Programming: A Brief Lead-In. Constraint Programming.-Springer-Verlag Berlin Heidelberg (1994), 1–16.

    Google Scholar 

  9. Hentenryck P. van: Constraint Satisfaction Using Constraint Logic Programming, Artificial Intelligence, Vol. 58, (1992), 113–159.

    Article  Google Scholar 

  10. Benhamou F., Older W.J.: Applying Interval Arithmetic to Real, Integer and Boolean Constraints, Journal of Logic Programming, (1996). To appear.

    Google Scholar 

  11. Goguen J.A., Meseguer J.: Models and Equality for Logical Programming, Lect. Notes in Comp. Sci., Vol. 250, Springer, (1987), p. 1–22.

    Google Scholar 

  12. Telerman V.V.: Active Data Types, Preprint USSR Acad. Sci., Siberian Division, Computer Center, 792, Novosibirsk, (1988), 30 p. (in Russian).

    Google Scholar 

  13. Narin'yani A.S., Telerman V.V., Dmitriev V.E.: Virtual Data-Flow Machine as Vehicle of Inference/Computations in Knowledge Bases, In: Ph. Jorrand, V. Sgurev (Eds.) Artificial Intelligence II: Methodology, Systems, Application, North-Holland, (1987), 149–154.

    Google Scholar 

  14. Telerman V.V., Ushakov D.M.: Subdefinite Models: Formalisation and Perspectives, In: Knowledge Processing Based on Subdefiniteness, RRIAI, Novosibirsk-Moscow, (1996), (in Russian).

    Google Scholar 

  15. Alefeld G., Herzberger Ju.: Introduction in Interval Computations, Academic Press, New York, 1983.

    Google Scholar 

  16. Hyvonen E.: Constraint reasoning based on interval arithmetic: the tolerance propagation approach, Artificial Intelligence, 58, (1992), 71–112.

    Article  MathSciNet  Google Scholar 

  17. Nechepurenko M.I.: Elements of Boolean Interval Analisys, In: System Simulation in Informatics, SS-11, Novosibirsk, (1985), 37–61. (In Russian).

    Google Scholar 

  18. Yakovlev A.G.: Computer Arithmetic of Multiintervals, Problems of Cybernetics. Problem-oriented computational systems, (1987), 66–81. (In Russian).

    Google Scholar 

  19. Telerman V.V.: Using Multiintervals in Subdefinite Models, In: Parallel programming and supercomputers: methods of knowledge representation in information technologies: Proc.of X All-Union Conf., Ufa, 19–26 June 1990 — Kiev, (1990), 128–129. (in Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jacques Calmet John A. Campbell Jochen Pfalzgraf

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Telerman, V., Ushakov, D. (1996). Data types in subdefinite models. In: Calmet, J., Campbell, J.A., Pfalzgraf, J. (eds) Artificial Intelligence and Symbolic Mathematical Computation. AISMC 1996. Lecture Notes in Computer Science, vol 1138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61732-9_65

Download citation

  • DOI: https://doi.org/10.1007/3-540-61732-9_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics