Abstract
In the present paper we describe the notion of subdefinite computation models (SD-models), introduced by A.S.Narinyani to represent subdefinite information in databases of AI systems. As the algorithm for problem solving, we use the technique of constraint propagation, which significantly reduces the solution space. Application of SD-models to the routing problem is described.
Preview
Unable to display preview. Download preview PDF.
References
Narin'yani A.S., at al. Virtual Data-Flow Machine as Vehicle of Inference/Computations in Knowledge Bases. Artificial Intelligence II. Methodology, Systems, Applications. North-Holland, 1987, pp. 149–154.
Constraint Programming. NATO ASI SERIES F: Computer and Systems Sciences. Springer Verlag, 1994.
Freuder E., Wallace R. Partial Constraint Satisfaction // Artificial Intelligence, V. 58, 1992, P. 3–20.
E. Constraint Reasoning Based on Interval Arithmetic: the Tolerance Propagation Approach // Artificial Intelligence, V. 58, 1992, P. 71–112.
Technological environment for construction and processing sub-definite models, Proceedings of East-West AI Conference: from theory to practice, September 7–9, Moscow, 1993, pp.356–360.
Eclipse 3.5 (ECRC Common Logic Programming System), User Manual. International Computers Limited and ECRC GmbH, 1992
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yakhno, T.M., Cheblakov, G.B., Zilberfain, V.Z. (1996). FISSURE: Finder of solutions with subdefinite resources. In: Kuper, G., Wallace, M. (eds) Constraint Databases and Application. CDB 1995. Lecture Notes in Computer Science, vol 1034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60794-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-60794-3_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60794-6
Online ISBN: 978-3-540-49456-0
eBook Packages: Springer Book Archive