Technology
Computer vision systems
Hanson, A. R. | Riseman, E. M.
Expert system technology has been successfully applied to many practical problems, but. In this paper we discuss some of the problems confronting computer vision and present an approach to the development of general knoledge-based vision systems. The primary mechanism is a rule-based approach for the generation of initial object hypotheses, which allow focus of attention strategies. The rule set, applied to the attributes of the lines, regions, and surfaces in an intermediate symbolic representation, is constructed interactively with visual feedback to the user. Simples rules are defined as ranges over a feature value which are converted to a vote for an object label; complex rules are constructed via a functional combination of the output from the simple rules.
Models of learning systems
Buchanan, B. G. | Mitchell, T. M. | Smith, R. G. | Johnson, C. R.
"The terms adaptation, learning, concept-formation, induction, self-organization, and self-repair have all been used in the context of learning system (LS) research. The research has been conducted within many different scientific communities, however, and these terms have come to have a variety of meanings. It is therefore often difficult to recognize that problems which are described differently may in fact be identical. Learning system models as well are often tuned to the require- ments of a particular discipline and are not suitable for application in related disciplines."In Encyclopedia of Computer Science and Technology, Vol. 11. Dekker
A model based method for computer aided medical decision making
"A CASNET model consists of three main components: observations of a patient, pathophysiological states, and disease classifications. As observations are recorded, they are associated with the appropriate intennediate states. These states, in turn, are typically causally related, thereby forming a network that summarizes the mechanisms of disease. It is these patterns of states in the network that are linked to individual disease classes." Artificial intelligence, August, 1978. Reprinted in Clancey & Shortliffe. Readings in Medical Artificial Intelligence: The First Decade. Ch. 7.
Pattern-based representation of chess end-game knowledge
Bratko, L. | Kopec, D. | Michie, D.
Master skill--operational in the sense-t'hat it can be run on Another form of the'Master skill' aspiration aims at correct'strong mastery' in this sense is attainable for the complete None of the above listed endgames contains anything problematical from a Master's point of view and computer programs Using a vocabulary which is defined in Kmoch's (1959) 'An enemy pawn ahead on the same file is a counterpawn, Some of these relations may be very useful if developed further. For expmple, if a pawn is'overloaded', in that it is pefforming Defence Diagram, see Figure 1). A rule is applied'to a position (in a manner familiar to'forcing tree' that guarantees the achievement of better-goals The'and-or' tree search, carried out by module 1 of the AU Figure 1 The ADD corresponding to the position shown in Figure 1. The Computer Journal ' HOW DIFFICULT IS THE KNKR PROBLEM? Longest variation in Fine before capture of the Knight: 24 moves; longest known variation 27 moves.
Version spaces: A candidate elmination approach to rule learning
"An important research problem in artificial intelligence is the study of methods for learning general concepts or rules from a set of training instances. An approach to this problem is presented which is guaranteed to find, without backtracing, all rule versions consistent with a set of positive and negative training instances. The algorithm put forth uses a representation of the space of those rules consistent with the observed training data. This "rule version space" is modified in response to new training instances by eliminating candidate rule versions found to conflict with each new instance. The use of version spaces is discussed in the context of Meta-DENDRAL, a program which learns rules in the domain of chemical spectroscopy."Proc. IJCAI 77 VOL 1 MASSACHUSETTS INSTITUTE OF TECHNOLOGY CAMBRIDGE, MASSACHUSETTS, USA AUGUST 22 - 25 , 1977, pp.305-310
Informality in program specification
Balzer, R. M., Goldman, N., Wile, D.
This paper is concerned primarily with (1) the procedure by which process-oriented specifications are obtained from goal-oriented requirement specifications and (2) computer-based tools for their construction. It first determines some attributes of a suitable process-oriented specification language, then examines the reasons why specifications would still be difficult to write in such a language. The key to overcoming these difficulties seems to be the careful introduction of informality based on partial, rather than complete, descriptions and the use of a computer-based tool that uses context extensively to complete these descriptions during the process of constructing a well-formed specification. Some results obtained by a running prototype of such a computer-based tool on a few informal example specifications are presented and, finally, some of the techniques used by this phototype system are discussed.
Every planar map is four colorable: Part I: Discharging
You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither Project Euclid nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations. Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the Project Euclid website.