Data types in subdefinite models

  • Vitaly Telerman
  • Dmitry Ushakov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1138)


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.


Constraint Satisfaction Operational Semantic Common Fixed Point Interval Arithmetic Predicate Symbol 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [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. [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. [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. [5]
    Babichev A.B., et al.: UniCalc — an intelligent solver for mathematical problems, Ibid, 257–260.Google Scholar
  6. [6]
    Borde S.B., et al.: Subdefiniteness and Calendar Scheduling, Ibidem, 315–318.Google Scholar
  7. [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. [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. [9]
    Hentenryck P. van: Constraint Satisfaction Using Constraint Logic Programming, Artificial Intelligence, Vol. 58, (1992), 113–159.CrossRefGoogle Scholar
  10. [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. [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. [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. [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. [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. [15]
    Alefeld G., Herzberger Ju.: Introduction in Interval Computations, Academic Press, New York, 1983.Google Scholar
  16. [16]
    Hyvonen E.: Constraint reasoning based on interval arithmetic: the tolerance propagation approach, Artificial Intelligence, 58, (1992), 71–112.CrossRefMathSciNetGoogle Scholar
  17. [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. [18]
    Yakovlev A.G.: Computer Arithmetic of Multiintervals, Problems of Cybernetics. Problem-oriented computational systems, (1987), 66–81. (In Russian).Google Scholar
  19. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Vitaly Telerman
    • 1
  • Dmitry Ushakov
    • 1
  1. 1.Institute of Informatics SystemsRussian Academy of Science, Siberian DivisionRussia

Personalised recommendations