Representation & Reasoning


Hard and Easy SAT Problems

Classics

"We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satisfiability testing is quite difficult. Our results provide a benchmark for the evaluation of satisfiability-testing procedures." Proc. AAAI-92.


Eliminating expensive chunks by restricting expressiveness

Classics

Proc. Eleventh Intl. Joint Conference on Artificial Intelligence (pp. 731-737). Detroit, MI: IJCAII.


Classifier systems and genetic algorithms

Classics

ABSTRACT Classifier systems are massively parallel, message-passing, rule-based systems that learn through credit assignment (the bucket brigade algorithm) and rule discovery (the genetic algorithm). They typically operate in environments that exhibit one or more of the following characteristics: (1) perpetually novel events accompanied by large amounts of noisy or irrelevant data; (2) continual, often real-time, requirements for action; (3) implicitly or inexactly defined goals; and (4) sparse payoff or reinforcement obtainable only through long action sequences. Classifier systems are designed to absorb new information continuously from such environments, devising sets of compet- ing hypotheses (expressed as rules) without disturbing significantly capabilities already acquired. This paper reviews the definition, theory, and extant applications of classifier systems, comparing them with other machine learning techniques, and closing with a discussion of advantages, problems, and possible extensions of classifier systems. Artificial Intelligence, 40 (1-3), 235-82.


Induction of decision trees

Classics

The technology for building knowledge-based systems by inductive inference from examples hasbeen demonstrated successfully in several practical applications. This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such system, ID3, in detail. Results from recent studies show ways in which the methodology can be modified to deal with information that is noisy and/or incomplete. A reported shortcoming of the basic algorithm is discussed and two means of overcoming it are compared. The paper concludes with illustrations of current research directionsMachine Learning, 1, p. 81-106


NON-VON's applicability to three AI task areas

Classics

Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, Calif., pp. 61-70


Application of the PROSPECTOR system to geological exploration problems

Classics

A practical criterion for the success of a knowledge-based problem-solving system is its usefulness as a tool to those working in its specialized domain of expertise. This paper describes an evaluation and several applications of a knowledge-based system, the PROSPECTOR consultant for mineral exploration. PROSPECTOR is a rule-based judgmental reasoning system that evaluates the mineral potential of a site or region with respect to inference network models of specific classes of ore deposits. Knowledge about a particular type of ore deposit is encoded in a computational model representing observable geological features and the relative significance thereof.In Hayes, J. E., Michie, D., and Pao, Y.-H. (Eds.), Machine Intelligence 10. Ellis Horwood.


Search vs. knowledge : an analysis from the domain of games

Classics

Presented at the NATO Symposium Human and Artificial Intelligence, Lyon, France, October, CMU Technical Report



Models of learning systems

Classics

"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


The Art of Artificial Intelligence: Themes and Case Studies of Knowledge Engineering

Classics

See also: Stanford Heuristic Programming Project Memo HPP-77-25Proc. IJCAI-77: Fifth International Joint Conference on Artificial Intelligence, pp 1014-1029