Abstract
We study the mechanism of subdefinite models and the object-oriented technological environment NeMo+ for constructing solvers based on subdefinite models. The paper presents the main features of NeMo+ and shows its capabilities on the example of one logical-combinatorial problem.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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).
Narin'yani, A.S. Subdefiniteness and Basic Means of Knowledge Representation, Computers and Artificial Intelligence, Bratislawa, 2, No.5, (1983), 443–452.
A.S. Narin'yani, Subdefiniteness in Knowledge Representation and Processing, Trans. of USSR Acad. of Sciences, Technical cybernetics, No.5, Moscow, (1986), 3–28. (in Russian).
Babichev, A.B., et al. UniCalc — an intelligent solver for mathematical problems, Proc. of East-West AI Conference: from theory to practice, Moscow, (1993), 257–260.
Borde, S.B., et al.: Subdefiniteness and Calendar Scheduling, Ibid, 315–318.
Telerman, V.V. Propagation of Mathematical Constraints in Subdefinite Models, Lect. Notes in Comp. Sci.,958, Springer, (1995), 191–208.
Mackworth, A.K.: Consistency in Networks of Relations, Artificial Intelligence 8, (1977), 99–118.
Montanari, U.: Networks of Constraints: Fundamental Properties and Application to Picture Processing, Information Science, 7, (1992).
Hentenryck, P. Van: Constraint Satisfaction Using Constraint Logic Programming, Artificial Intelligence, 58, (1992), 113–159.
Mayoh, B., Tyugu, E., Uustalu, T.: Constraint Satisfaction and Constraint Programming: A Brief Lead-In. Constraint Programming. — Springer, (1994), 1–16.
Hyvonen, E.: Constraint reasoning based on interval arithmetic: the tolerance propagation approach, Artificial Intelligence, 58, (1992), 71–112.
Benhamou, F., W.J.Older: Applying Interval Arithmetic to Real, Integer and Boolean Constraints, Journal of Logic Programming, (1996). (To appear).
Van Emden, M.H. Value constraints in the CLP scheme, Proc. of the ILPS, Workshop on Interval Constraints, Portland Oregon, (1995).
Interval Mathematics, Lect. Notes in Computer Science, n.4, vol. 29, (1975).
Yakovlev, A.G. Computer Arithmetic of Multiintervals, Problems of Cybernetics. Problem-oriented computational systems, (1987), 66–81. (In Russian).
Telerman, V.V.: Using of Multiintervals in SD-Models, Proc. of X All-Union Conf. ”Parallel programming and high-performance systems”, Kiev, (1990). (in Russian).
Telerman, V.V., D.M. Ushakov: Subdefinite Models: Formalisation and Perspectives, Knowledge Processing Based on Subdefiniteness, RRIAI, Moscow-Novosibirsk, (1996). (in Russian).
Narin'yani, A.S., V.V.Telerman, V.E.Dmitriev Virtual Data-Flow Machine as Vehicle of Inference/Computations in Knowledge Bases, Ph. Jorrand, V. Sgurev (Eds.) Artificial Intelligence II: Methodology, Systems, Application, North-Holland, (1987), 149–154.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Telerman, V., Sidorov, V., Ushakov, D. (1996). Problem solving in the object-oriented technological environment NeMo+. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Perspectives of System Informatics. PSI 1996. Lecture Notes in Computer Science, vol 1181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62064-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-62064-8_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62064-8
Online ISBN: 978-3-540-49637-3
eBook Packages: Springer Book Archive