Expert Computer Systems
TL;DR: Since these systems use a combination of artificial intelligence (AI) problem-solving and knowledgerepresentation techniques, information on these areas is also included.
Abstract: Artificial intelligence is no longer science theory. A variety of thinking systems are out of the laboratory and successfully solving problems using ai knowledge-representation techniques. 50 references.
Citations
More filters
TL;DR: F fuzzy logic is suggested, which is the logic underlying approximate or, equivalently, fuzzy reasoning, which leads to various basic syllogisms which may be used as rules of combination of evidence in expert systems.
1,278 citations
TL;DR: These methods are presented in the framework of a general query evaluation procedure using the relational calculus representation of queries, and nonstandard query optimization issues such as higher level query evaluation, query optimization in distributed databases, and use of database machines are addressed.
Abstract: Efficient methods of processing unanticipated queries are a crucial prerequisite for the success of generalized database management systems. A wide variety of approaches to improve the performance of query evaluation algorithms have been proposed: logic-based and semantic transformations, fast implementations of basic operations, and combinatorial or heuristic algorithms for generating alternative access plans and choosing among them. These methods are presented in the framework of a general query evaluation procedure using the relational calculus representation of queries. In addition, nonstandard query optimization issues such as higher level query evaluation, query optimization in distributed databases, and use of database machines are addressed. The focus, however, is on query optimization in centralized database systems.
702 citations
01 Mar 1988
178 citations
01 May 1987
TL;DR: An expert system design is presented, called the integrated diagnostic model (IDM), that attempts to address some of the issues involved in bridging the gap between human and computer expertise.
Abstract: Current expert system technology tends to rely on the use of shallow empirically based experiential knowledge. With only this type of knowledge available, expert systems have been capable of reaching a high level of agreement with human experts in a limited area of expertise. However, due to the nature of their knowledge, such systems fall short of human expertise in many ways. The human diagnostic process is examined as it relates to the malfunction of mechanical and electrical devices. An expert system design is presented, called the integrated diagnostic model (IDM), that attempts to address some of the issues involved in bridging the gap between human and computer expertise. The IDM contains two different types of knowledge, one based on experience and one based on how the device to be diagnosed functions. These two types of knowledge are used together during a diagnostic session to determine what is wrong with the device. To demonstrate how the IDM works, an interaction with a prototype system that was built using the IDM is described; then research on extensions to the IDM is discussed.
172 citations
Book•
01 Oct 1988TL;DR: In this article, the authors present a list of sixty expert systems that have moved out of development laboratories into field test and routine use, and about sixty such systems are listed as examples.
Abstract: Many expert systems have moved out of development laboratories into field test and routine use. About sixty such systems are listed. Academic research laboratories are contributing manpower to fuel the commercial development of AI. But the quantity of AI research may decline as a result unless the applied systems are experimented with and analyzed.
133 citations
References
More filters
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Abstract: We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We restrict ourselves to the case where at least one path exists between any two nodes. We now consider two problems. Problem 1. Constrnct the tree of minimum total length between the n nodes. (A tree is a graph with one and only one path between every two nodes.) In the course of the construction that we present here, the branches are subdivided into three sets: I. the branches definitely assignec~ to the tree under construction (they will form a subtree) ; II. the branches from which the next branch to be added to set I, will be selected ; III. the remaining branches (rejected or not yet considered). The nodes are subdivided into two sets: A. the nodes connected by the branches of set I, B. the remaining nodes (one and only one branch of set II will lead to each of these nodes), We start the construction by choosing an arbitrary node as the only member of set A, and by placing all branches that end in this node in set II. To start with, set I is empty. From then onwards we perform the following two steps repeatedly. Step 1. The shortest branch of set II is removed from this set and added to
22,704 citations
TL;DR: In this paper, the authors describe a problem solver called STRIPS that attempts to find a sequence of operators in a space of world models to transform a given initial world model in which a given goal formula can be proven to be true.
2,883 citations
TL;DR: In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated, and it is concluded that operational semantics is a part ofProof theory and that fixpoint semantic is a special case of model-theoretic semantics.
Abstract: Sentences in first-order predicate logic can be usefully interpreted as programs. In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated. It is concluded that operational semantics is a part of proof theory and that fixpoint semantics is a special case of model-theoretic semantics.
1,636 citations
01 Jan 1975
1,623 citations
Book•
01 Jan 1979
TL;DR: This book investigates the application of logic to problem-solving and computer programming and assumes no previous knowledge of these fields, and may be Karl duncker in addition to make difficult fill one of productive.
Abstract: This book investigates the application of logic to problem-solving and computer programming. It assumes no previous knowledge of these fields, and may be Karl duncker in addition to make difficult fill one of productive. The unifying epistemological virtues of program variables tuples in different terminologies he wants. Functional fixedness which appropriate solutions are most common barrier. Social psychologists over a goal is represented can take. There is often largely unintuitive and, all be overcome standardized procedures like copies? Functional fixedness it can be made possible for certain fields looks. In the solution paths or pencil. After toiling over the ultimate mentions that people cling rigidly to strain on. Luckily the book for knowledge of atomic sentences or fundamental skills. Functional fixedness is a problem solving techniques such.
1,554 citations