A unifying framework for concept-learning, derived from Mitchell's Generalization as Search-paradigm, is presented. Central to the framework is the generic algorithm Gencol. Gencol forms a synthesis of existing concept-learning algorithms as it identifies the key issues in concept-learning: the representation of concepts and examples, the search strategy and heuristics, and the operators that transform one concept-description into another one when searching the concept description space. Gencol is relevant for practical purposes as it offers a solid basis for the design and implementation of concept-learning algorithms. The presented framework is quite general as seemingly disparate algorithms such as TDIDT, AQ, MIS and version spaces fit into Gencol.

The purpose of this paper is to review the use of knowledge-based systems and artificial intelligence (AI) in business. Part I of this paper examines domain applications, the use of different knowledge representations, unique contributions for knowledge acquisition from the development of systems for business applications, and models of explanation for systems developed for business. In addition, the paper discusses the use of both normative and descriptive AI systems to model business judgments. Finally, the paper provides a summary of publication sources and meetings on business systems.

Agent software is a rapidly developing area of research. However, the overuse of the word “agent” has tended to mask the fact that, in reality, there is a truly heterogeneous body of research being carried out under this banner. This overview paper presents a typology of agents. Next, it places agents in context, defines them and then goes on, inter alia, to overview critically the rationales, hypotheses, goals, challenges and state-of-the-art demonstrators of the various agent types in our typology. Hence, it attempts to make explicit much of what is usually implicit in the agents literature. It also proceeds to overview some other general issues which pertain to all the types of agents in the typology. This paper largely reviews software agents, and it also contains some strong opinions that are not necessarily widely accepted by the agent community.

Based on a survey of recent literature, this report aims to highlight the issues associated with the verification and validation of knowledge based systems. The confusion arising from the lack of clear terminology is considered, along with some of the characteristics of knowledge based systems that cause particular difficulties for verification and validation. The various approaches that can be adopted to address these difficulties are discussed, followed by a survey of recent research initiatives.

The author concludes that many of the difficulties associated with the verification and validation of knowledge based systems are a feature of the complexity of the system being built and the manner of its development rather than of the specific technology chosen to implement it.

Case-Based Reasoning (CBR) is a fresh reasoning paradigm for the design of expert systems in domains that may not be appropriate for other reasoning paradigms such as model-based reasoning. As a result of this, and because of its resemblance to human reasoning, CBR has attracted increasing interest both from those experienced in developing expert systems and from novices. Although CBR is a relatively new discipline, there are an increasing number of papers and books being published on the subject. In this context, this bibliographic categorization is an accompanying paper to a review of CBR by the same authors. The objective of this paper is to help researchers quickly identify relevant references.

This paper surveys a variety of deductive database theories. Such theories differ from one another in the set of axioms and metarules that they allow and use. The following theories are discussed: relational, Horn, and stratified in the text; protected, disjunctive, typed, extended Horn, and normal in the appendix. Connections with programming in terms of the declarative, fixpoint, and procedural semantics are explained. Negation is treated in several different ways: closed world, completed database, and negation as failure. For each theory examples are given and implementation issues are considered.