Hostname: page-component-6898cfcb55-kwdml Total loading time: 0 Render date: 2026-11-11T05:44:44.645Z Has data issue: false hasContentIssue false
  • English
  • Français

Constraint mechanisms for knowledge acquisition from computer-aided design data

Published online by Cambridge University Press:  27 February 2009

Harley R. Myler,
Avelino J. Gonzalez and
Massood Towhidnejad
Harley R. Myler
Affiliation:
Department of Electrical and Computer Engineering, University of Central Florida, Orlando, FL 32816-0450
Avelino J. Gonzalez
Affiliation:
Department of Electrical and Computer Engineering, University of Central Florida, Orlando, FL 32816-0450
Massood Towhidnejad
Affiliation:
Department of Aviation Computer Science, Embry-Riddle Aeronautical University, Daytona Beach, FL 32114, USA
Get accessRights & Permissions [Opens in a new window]

Abstract

A number of automated reasoning systems find their basis in process control engineering. These programs are often model-based and use individual frames to represent component functionality. This representation scheme allows the process system to be dynamically monitored and controlled as the reasoning system need only simulate the behavior of the modeled system while comparing its behavior to real-time data. The knowledge acquisition task required for the construction of knowledge bases for these systems is formidable because of the necessity of accurately modeling hundreds of physical devices. We discuss a novel approach to the capture of this component knowledge entitled automated knowledge generation (AKG) that utilizes constraint mechanisms predicated on physical behavior of devices for the propagation of truth through the component model base. A basic objective has been to construct a complete knowledge base for a model-based reasoning system from information that resides in computer-aided design (CAD) databases. If CAD has been used in the design of a process control system, then structural information relating the components will be available and can be utilized for the knowledge acquisition function. Relaxation labeling is the constraint-satisfaction method used to resolve the functionality of the network of components. It is shown that the relaxation algorithm used is superior to simple translation schemes.

Information

Type
Research Article
Information
AI EDAM , Volume 7 , Issue 3 , August 1993, pp. 181 - 188
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Beasley, W. G. 1986. Expert system rules from CAD databases. Proceedings of the American Control Conference, Seattle, Washington, 146–151.Google Scholar
Bible, W. 1988. Constraint satisfaction from a deductive viewpoint. Artificial Intelligence 35(3), 401–413.CrossRefGoogle Scholar
Borning, A. 1981. The programming language aspects of the ThingLab, a constraint-oriented simulation laboratory. ACM Transactions on Programming Languages and Systems 3(4), 353–387.CrossRefGoogle Scholar
Borning, A., Duisberg, R. and Freeman-Benson, B. 1987. Constraint hierarchies. Proceedings of Object-Oriented Programming Systems, Languages and Applications, pp 48–60.Google Scholar
Dechter, R. and Pearl, J. 1988. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence 34(1), 1–38.CrossRefGoogle Scholar
Dreyfus, H. L. and Dreyfus, S. E. 1986. Mind over Machine. New York: Macmillan.Google Scholar
Jamieson, J. R., Scarl, E. A. and Delaune, C. I. 1985. A knowledge based expert system for propellant system monitoring at the Kennedy Space Center. Proceedings of the 22nd Space Congress 22, 1–9.Google Scholar
Freuder, E. C. 1982. A sufficient condition of backtrack-free search. Journal of the Association for Computing Machinery 29(1), 24–32.CrossRefGoogle Scholar
Freuder, E. C. 1985. A sufficient condition of backtrack-bounded search. Journal of the Association for Computing Machinery 32(4), 755–761.CrossRefGoogle Scholar
Gonzalez, A. J., Myler, H. R. and Kladke, R. R. (1991). Identification of unconstrained item descriptions using string-match heuristics. International Journal of Expert Systems 4(3), 337–364.Google Scholar
Kladke, R. 1989. A mega-heuristic approach to the problem of component identification in automated knowledge generation. Master’s Thesis, University of Central Florida, Orlando, FL.Google Scholar
Leler, WM. 1988. Constraint Programming Languages: Their Specification and Generation. Reading: Addison-Wesley.Google Scholar
Myler, H. R., Gonzalez, A. J., Towhidnejad, M., McKenzie, R. and Kladke, R. R. 1989. Automated knowledge generation from incomplete CAD data: research results. Proceedings of the Second Florida AI Research Symposium 2, 10–15.Google Scholar
Scarl, E. A., Jamieson, J. R. and Delaune, C. I. 1987. Diagnosis and sensor validation through knowledge of structure and function. IEEE Transactions on Systems, Man and Cybernetics 17(3), 360–368.CrossRefGoogle Scholar
Sussman, G. J. and Steele, G. L. 1979. Constraints—a language for expressing almost-hierarchical descriptions. Artificial Intelligence 14(1), 1–40.CrossRefGoogle Scholar