Abstract
There is a symbiosis between artificial intelligence (AI) and constraint programming (CP). In this chapter we will describe both the relevance of many AI ideas on knowedge representation and reasoning to CP and the contribution new CP ideas and techniques can make to AI. It is a historic fact that many constraint programming techniques were developed by people primarily interested in artificial intelligence problems. In this chapter we shall look not only at the work of such pioneers, because they were explicit about the connections between AI and CP, but also at more recent work of AI-ers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Backstrom, C. (1992). Computational complexity of reasoning about plans. Ph. D. thesis, Linkoping University, Linkoping, Sweden.
Benjamin, M., T. Viana, K. Corbett, and A. Silva (1993). Satisfying multiple rated constraints in a knowledge based decision aid. In Proc. 9 Conf.Art.Int.Appl., pp. 277–283.
BharatRao, R. and S. C.-Y. Lu (1993). A knowledge based equation discovery system for engineering domains. IEEE Expert 8, 37–42.
Bhatnagar, N. (1990). Adaptive search by learning from incomplete examples. In Proc. 8 Nat.Conf.AI. MIT Press.
Boden, M. (1990). The Creative Mind & Mechanisms. George Weidenfeld and Nicholson.
Bongard, N. (1970). Pattern Recognition. Spartan Books.
Brookes, R. A. (1991). Intelligence without reason. In Proc.12 IJCAI, pp. 569–595. Morgan Kaufmann.
Bruynooghe, M. and L. M. Pereira (1984). Deduction revision by intelligent backtracking. In J. A. Campbell (Ed.), Implementations of Prolog. Ellis Horwood.
Cheeseman, P., B. Kanefsky, and W. M. Taylor (1991). Where the really hard problems are. In Proc. 12 IJCAI, pp. 331–337.
Codognet, P. and V. Saraswat (1992). Abduction in concurrent constraint programming. Technical report, Xerox Park.
Day, D. S. (1992). Acquiring search heuristics automatically for constraint-based planning and scheduling. In J. Hendler (Ed.), Artificial intelligence planning systems. Morgan Kaufmann.
Dechter, R. (1986). Learning while searching in constraint satisfaction problems. In AAAI-86 Proceedings. Morgan Kaufmann.
Evans, T. G. (1968). A heuristic program to solve geometric analogy problems. In M. Minsky (Ed.), Semantic Information Processing. MIT Press.
Freedman, D. (1993). Ai helps researchers find meaning in molecules. Science 261, 844–845.
Furukawa, K. (1992). Logic programming as the integrator of the fifth generation computer systems project. Comm.ACM 35, 82–92.
Geffner, H. and J. Pearl (1987). An improved constraint-propagation algorithm for diagnosis. In Proc. 10 IJCAI, Milan. Morgan Kaufman.
Gentner, D. (1983). Structure-mapping: a theoretical framework for analogy. Cognitive Science 7.
Goguen, J. A. and R. M. Burstall (1984). Introducing institutions. LNCS 164, 221–256, Springer-Verlag.
Hess, L. and B. Mayoh (1990). The four musicians: analogies and expert systems - a graphic approach. LNCS 532, 430–445, Springer-Verlag.
Huberman, B. A. and T. Hogg (1987). Phase transitions in artificial intelligence systems. Art.Int. 33, 155–171.
Kaplan, R. M. and J. Bresman (1982). Lexical Functional Grammar: a formal system for grammatical representations. MIT Press.
Koza, J. R. (1992). Genetic Programming - on the programming of computers by means of natural selection. MIT Press.
Langley, W., H. Simon, and G. Bradshaw (1983). Rediscovering chemistry with the bacon system. In R. Michalski, J. G. Carbonell, and T. M. Mitchell (Eds.), Machine Learning, an artificial intelligence approach. Tioga and Springer-Verlag.
Lavrac, N. and S. Dzeroski (Eds.) (1993). Inductive Logic. Programming: techniques and applications. Ellis Horwood.
Lin, W. C., E. C. K. Tsao, and C. T. Chen (1992). Constraint satisfaction neural networks for image segmentation. Pattern Recognition 25, 679–693.
Mackworth, A. K. (1977). Consistency in networks of relations. Art.Int. 8, 99–118.
Maes, P. (Ed.) (1991). Designing autonomous agents. MIT Press.
Margolis, H. (1987). Patterns, Thinking, and Cognition: a theory of justice. University of Chicago Press.
Marr, D. (1982). Vision. W. H. Freeman.
Minton, S. (1991). Prodigy: an integrated architecture for planning and learning. In K. VanLehn (Ed.), Architectures for Intelligence. Lawrence Erlbaum.
Mitchell, D. (1992). Hard and easy distributions of sat problems. In AAAI-92 Proceedings, San Jose, California.
Mitchell, M. (1993). Analogy-making as Perception: a computer model. Bradford Book. MIT Press.
Montanari, U. (1974). Networks of constraints: fundamental properties and applications to picture processing. Information Sciences 7, 95–132.
Muggleton, S. (Ed.) (1992). Inductive Logic Programming. A.P.I.C. Academic Press.
Murphy, D. (1993). Time and duration in noninterleaving concurrency. Fandamenta Informatica 5, 403–416.
Musick, R. and S. Russell (1992). How long will it take? In AAAI-92 Proceedings, San Jose, California.
Narinyani, A. S. (1983). Subdefiniteness and basic means of knowledge representation. Comp.Art.Int. 2, 443–452.
Owen, S. (1990). Analogy for Automated Reasoning. Academic Press.
Piatersky, G. and W. J. Frawley (Eds.) (1993). Knowledge Discovery in Databases. AAAI Press.
Prosser, P. (1993). Hybrid algorithms for the constraint satisfaction problem. Comp.Int. 9, 268–299.
Reece, D. A. and S. A. Shafer (1993). A computational model of driving for autonomous vehicles. Transport Research 27A, 23–50.
Resnikoff, H. L. (1987). The Illusion of Reality. Springer-Verlag.
Richards, B., I. Kraan, and B. Kuipers (1992). Automatic abduction of qualitative models. In AAAI-92 Proceedings. Morgan Kaufmann.
Sandewall, S. and R. Ronnquist (1986). A representation of action structures. In AAAI-86 Proceedings. Morgan Kaufmann.
Schreiber, M. (1992). Constraint-based grammar formalisms. MIT press.
Simon, H. A. (1969). The Sciences of the Artificial. MIT Press.
Sowa, J. F. (1984). Conceptual Structures: information processing in mind and machine. Addison-Wesley.
Sowa, J. F. (Ed.) (1991). Principles of Semantic Networks: explorations in the representation of knowledge. Morgan Kaufman.
Stallman, R. and G. J. Sussman (1977). Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Art.Int. 9, 135–196.
Stefik, M. (1981). Planning with constraints. Art.Int. 16, 111–170.
Sussman, G. J. and G. L. Steele Jr. (1980). Constraints a language for expressing almost-hierarchical descriptions. Art.Int. 14, 1–39.
Townidnejad, M., H. R. Myler, and A. J. Gonzalez (1993). Constraint mechanisms in automated knowledge generation. Applied Art. Int. 7, 113–134.
Uckun, S., S. Bagchi, K. Kawamura, and Y. Miyabe (1993, oct). Managing genetic search in jobshop scheduling. IEEE Expert 8, 34–45.
Waltz, D. (1975). Understanding line drawings of scenes with shadows. In P. H. E. Winston (Ed.), The Psychology of Computer Vision. McGraw-Hill.
Williams, C. and T. Hogg (1992). Using deep structure to locate hard problems. In AAAI-92 Proceedings, San Jose, California.
Williams, C. and T. Hogg (1993). The typicality of phase transitions in search. Comp.Int. 9, 221–238.
Winston, P. H. (1975). The Psychology of Computer Vision. McGraw-Hill.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mayoh, B. (1994). Constraint Programming and Artificial Intelligence. In: Mayoh, B., Tyugu, E., Penjam, J. (eds) Constraint Programming. NATO ASI Series, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85983-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-85983-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85985-4
Online ISBN: 978-3-642-85983-0
eBook Packages: Springer Book Archive