AUTOCELL is a system developed to assist in the operation and management of cellular mobile networks operated by Singapore Telecom. Its deployment is in line with the company's strategic move to introduce intelligent software into its operations. With the help of AI concepts and techniques, the system has enhanced the operational efficiency and network capacity and increased customer satisfaction with the network.

The Financial Crimes Enforcement Network (FIN-CEN) AI system (FAIS) links and evaluates reports of large cash transactions to identify potential money laundering. The objective of FAIS is to discover previously unknown, potentially high-value leads for possible investigation. FAIS integrates intelligent human and software agents in a cooperative discovery task on a very large data space. It is a complex system incorporating several aspects of AI technology, including rule-based reasoning and a blackboard. FAIS consists of an underlying database (that functions as a black-board), a graphic user interface, and several preprocessing and analysis modules. FAIS has been in operation at FINCEN since March 1993; a dedicated group of analysts process approximately 200,000 transactions a week, during which time over 400 investigative support reports corresponding to over $1 billion in potential laundered funds were developed. FAIS's unique analytic power arises primarily from a change in view of the underlying data from a transaction-oriented perspective to a subject-oriented (that is, person or organization) perspective.

Surely, scientific arguments Still, a full literature search of citations They are trivial, that is, when compared have their own special logic. of Rescher's 1977 monograph, to the defeasibility of open-textured Cavalli-Sforza has for a while been Dialectics, reveals no useful formal concepts, the logic of which interested in Toulmin's own attempts extension or clarification of the logical remains unanalyzed (says McCarty, to apply his work on argument to system prior to Brewka.

's performance exceeded the testers' performance on a different data set given a 99-percent confidence interval containing the true population scores for these

Randy Davis announced the appointment of six new program managers at ARPA. At IJCAI-95, Randall Davis assumed the office of president of the American For many attending the Fourteenth for consideration this year," noted Association for Artificial Intelligence International Joint Conference on Ray Perrault of SRI International, (AAAI). Davis is a professor of Artificial Intelligence (IJCAI-95), the chair of the conference. "This is more electrical engineering and computer most difficult problem was choosing than at IJCAI-93 and at recent science and associate director of the which session to attend in the rich, National Conferences on AI in the AI Lab at the Massachusetts Institute varied program. Davis succeeds data-mining application from rate was under 25 percent, showing Barbara Grosz, Gordon McKay professor the U.S. Department of the Treasury that there is a great deal of work of computer science in the Division that identifies potential money laundering going on, and the scientific standard of Applied Sciences at Harvard to a small mobile LEG0 robot of IJCAI matches or exceeds that of University.

Daewoo Heavy Industries, in conjunction with the Korean Advanced Institute of Science and Technology, integrated applicability and limitations of various five separate schedulers based on different several papers from the AI techniques. IAAI has been held annually that are addressed at the conference. Mita Industrial Co., Ltd., said Japan's troubleshooting expert system proceedings were published in book Seventeen applications represent this has been supplied as an embedded form through 1992. Since 1993, a year's award winners: 11 were from component of its photocopiers conference proceedings volume has the United States, 4 from the Pacific since April 1994. It uses new reasoning been published, and selected papers Rim, 1 from Europe, and 1 from the methods based on virtual cases have been republished as articles in Middle East.

OPUS is a branch and bound search algorithm that enables efficient admissible search through spaces for which the order of search operator application is not significant. The algorithm's search efficiency is demonstrated with respect to very large machine learning search spaces. The use of admissible search is of potential value to the machine learning community as it means that the exact learning biases to be employed for complex learning tasks can be precisely specified and manipulated. OPUS also has potential for application in other areas of artificial intelligence, notably, truth maintenance.

Characteristic models are an alternative, model based, representation for Horn expressions. It has been shown that these two representations are incomparable and each has its advantages over the other. It is therefore natural to ask what is the cost of translating, back and forth, between these representations. Interestingly, the same translation questions arise in database theory, where it has applications to the design of relational databases. This paper studies the computational complexity of these problems. Our main result is that the two translation problems are equivalent under polynomial reductions, and that they are equivalent to the corresponding decision problem. Namely, translating is equivalent to deciding whether a given set of models is the set of characteristic models for a given Horn expression. We also relate these problems to the hypergraph transversal problem, a well known problem which is related to other applications in AI and for which no polynomial time algorithm is known. It is shown that in general our translation problems are at least as hard as the hypergraph transversal problem, and in a special case they are equivalent to it.

This article describes an application of three well-known statistical methods in the field of game-tree search: using a large number of classified Othello positions, feature weights for evaluation functions with a game-phase-independent meaning are estimated by means of logistic regression, Fisher's linear discriminant, and the quadratic discriminant function for normally distributed features. Thereafter, the playing strengths are compared by means of tournaments between the resulting versions of a world-class Othello program. In this application, logistic regression - which is used here for the first time in the context of game playing - leads to better results than the other approaches.

Analogy has a rich history in Western civilization. Over the centuries, it has become reified in that analogical reasoning has sometimes been regarded as a fundamental cognitive process. In addition, it has become identified with a particular expressive format. The limitations of the modern view are illustrated by monster analogies, which show that analogy need not be regarded as something having a single form, format, or semantics. Analogy clearly does depend on the human ability to create and use well-defined or analytic formats for laying out propositions that express or imply meanings and perceptions. Beyond this dependence, research in cognitive science suggests that analogy relies on a number of genuinely fundamental cognitive capabilities, including semantic flexibility, the perception of resemblances and of distinctions, imagination, and metaphor. Extant symbolic models of analogical reasoning have various sorts of limitation, yet each model presents some important insights and plausible mechanisms. I argue that future efforts could be aimed at integration. This aim would include the incorporation of contextual information, the construction of semantic bases that are dynamic and knowledge rich, and the incorporation of multiple approaches to the problems of inference constraint.