Data types in subdefinite models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1138, Issue , 1996, Pages 305-319

  Telerman, Vitaly ^a   Ushakov, Dmitry ^a  

^a ENERGY SYSTEMS INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

DATA TYPE;

ARTIFICIAL INTELLIGENCE;

EID: 84947928697     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61732-9_65     Document Type: Conference Paper

References (19)

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).
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).
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).
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).
5. Babichev A.B., et al.: UniCalc-an intelligent solver for mathematical problems, 257-260.
6. Borde S.B., et al.: Subdefiniteness and Calendar Scheduling, Ibidem, 315-318.
7. Telerman V.V.: Propagation of Mathematical Constraints in Subdefinite Models, In: J.Calmet and J.A.CampbeE (Eds.), Integrating Symbolic Mathematical Computation and Artificial Intelligence, Lect. Notes in Comp. Sci., Vol. 958, Springer, (1995), 191-208.
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.
9. van Hentenryck P.: Constraint Satisfaction Using Constraint Logic Programming, Artificial Intelligence, Vol. 58, (1992), 113-159.
10. Benhamou F., Older W.J.: Applying Interval Arithmetic to Real, Integer and Boolean Constraints, Journal of Logic Programming, (1996). To appear.
11. Goguen J.A., Meseguer J.: Models and Equality for Logical Programming, Lect. Notes in Comp. Sci., Vol. 250, Springer, (1987), p. 1-22.
12. Telerman V.V.: Active Data Types, Preprint USSR Acad. Sci., Siberian Division, Computer Center, 792, Novosibirsk, (1988), 30 p. (in Russian).
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. Seurev (Eds.) Artificial Intelligence II: Methodology, Systems, Application, North-Holland, (1987), 149-154.
14. Telerman V.V., Ushakov D.M.: Subdefinite Models: Formalisation and Perspectives, In: Knowledge Processing Based on Subdefiniteness, RRIAI, Novosibirsk- Moscow, (1996), (in Russian).
15. Alefeld G., Herzberger Ju.: Introduction in Interval Computations, Academic Press, New York, 1983.
16. Hyvonen E.: Constraint reasoning based on interval arithmetic: the tolerance propagation approach, Artificial Intelligence, 58, (1992), 71-112.
17. Nechepurenko M.I.: Elements of Boolean Interval Analisys, In: System Simulation in Informatics, SS-11, Novosibirsk, (1985), 37-61. (In Russian).
18. Yakovlev A.G.: Computer Arithmetic of Multiintervals, Problems of Cybernetics. Problem-oriented computational systems, (1987), 66-81. (In Russian).
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)