×

Consistency in networks of relations. (English) Zbl 0341.68061


MSC:

68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
68N01 General topics in the theory of software
68Q25 Analysis of algorithms and problem complexity

Software:

Algorithm 97
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Aho, A. V.; Hopcroft, J. E.; Ullman, J. D., The Design and Analysis of Computer Algorithms (1974), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0286.68029
[2] Bobrow, D. G.; Raphael, B., New programming languages for AI research, Comput. Surv., 6, 153-174 (1974) · Zbl 0296.68096
[3] Burstall, R. M., A program for solving word sum puzzles, Comput. J., 12, 48-51 (1969) · Zbl 0164.46202
[4] Dahl, O. J.; Djikstra, E. W.; Hoare, C. A.R., Structured Programming (1972), Academic Press · Zbl 0267.68001
[5] Eastman, C. M., Automated space planning, Artificial Intelligence, 4, 41-64 (1973)
[6] Fikes, R. E., REF-ARF: A system for solving problems stated as procedures, Artificial Intelligence, 1, 27-120 (1970) · Zbl 0203.49403
[7] Floyd, R. W., Nondeterministic algorithms, J. Assoc. Comput. Mach., 14, 636-644 (1967) · Zbl 0153.47006
[8] Floyd, R. W., Algorithm 97: shortest path, Comm. ACM, 5, 345 (1962)
[9] Garey, M. R.; Johnson, D. S.; Stockmeyer, L., Some simplified NP-complete problems, (Proc. 6th Annu. ACM Symp. Theory Comput.. Proc. 6th Annu. ACM Symp. Theory Comput., Seattle, Wash. (1974)), 47-63 · Zbl 0338.05120
[10] Gaschnig, J. A., Constraint satisfaction method for inference making, (Proc. 12th Annu. Allerton Conf. Circuit System Theory. Proc. 12th Annu. Allerton Conf. Circuit System Theory, U. Ill., Urbana-Champaign (1974))
[11] Haims, M., On the optimum two-dimensional allocation problem, (Ph.D. Thesis (1966), Dept. of Electrical Engineering, New York University: Dept. of Electrical Engineering, New York University New York) · Zbl 0217.26904
[12] Mackworth, A. K., Using models to see, (Proc. Artificial Intelligence and the Simulation of Behavior Summer Conf. (1974), University of Sussex), 127-137
[13] Mackworth, A. K., Interpreting pictures of polyhedral scenes, Artificial Intelligence, 4, 121-137 (1973)
[14] Montanari, U., Networks of constraints: fundamental properties and applications to pictures processing, Inform. Sci., 7, 95-132 (1974) · Zbl 0284.68074
[15] Montanari, U., Optimization methods in image processing, (Proc. IFIP Congress (1974), North-Holland), 727-732 · Zbl 0296.68101
[16] Nilsson, N. J., Problem-solving Methods in Artificial Intelligence (1971), McGraw-Hill
[17] (Nilsson, N., Artificial intelligence—research and applications, progress report (1975), Stanford Research Institute)
[18] Rosenfeld, A.; Hummel, A.; Zucker, S. W., Scene labelling by relaxation operations, (Computer Science TR-379 (1975), University of Maryland) · Zbl 0335.68070
[19] Sussman, G. J.; McDermott, D. V., Why conniving is better than planning, (Artificial Intelligence Memo. No. 255A (1972), MIT)
[20] Sussman, G. J., The FINDSPACE problem, (Artificial Intelligence Memo. No. 286 (1973), MIT)
[21] Suzman, P. and Barrow, H.G. Private communication, 1975.; Suzman, P. and Barrow, H.G. Private communication, 1975.
[22] Turner, K. J., Computer perception of curved objects using a television camera, (Ph.D. Thesis (1974), Dept. of Machine Intelligence, School of Artificial Intelligence, University of Edinburgh)
[23] Unger, S. H., GIT—a heuristic program for testing pairs of directed line graphs for isomorphism, Comm. ACM, 7, 26-34 (1964) · Zbl 0123.33710
[24] Waltz, D. L., Generating semantic descriptions from drawings of scenes with shadows, (MAC-AI-TR-271 (1972), MIT)
[25] Warshall, S., A theorem on Boolean matrices, J. Assoc. Comput. Mach., 9, 11-12 (1962) · Zbl 0118.33104
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.