21852626
Search and Reasoning in Problem Solving
In the course of the extensive research that has been done on problem solving in AI , several rather distinct ways have emerged for representing and thinking about problem solving tasks. One way to view problem solving is as search. We postulate some kind of space in which treasures are hidden. We build symbol structures (nodes) that model this space, and 'move ' operators that alter these symbol structures, taking us from one node to another. In this metaphor, solving a problem consists in searching the model of the space (selectively), moving from one node to another along links that connect them until a treasure is encountered. A second way of viewing problem solving is as reasoning. We postulate a system of logic that allows us to deduce new statements from axioms and previously deduced statements. We represent a problem by a set of axioms in the formal language of our logic. In this metaphor, solving the problem consists in accumulating more and more information (more and more statements) by inference until the answer to the problem has been found. A third way of viewing problem solving is as constraint satisfaction. We postulate a set of objects and various subsets defined by the constraints they satisfy. In this metaphor, solving a problem consists in narrowing down the original set to a subset or unique object that satisfies all of the constraints. In no sense are the metaphors mutually exclusive; metaphors seldom are. The same problem-solving algorithm can be viewed, now as search, now as reasoning, now as constraint satisfaction. Consider, for example, a simple theorem-proving program that works forward from a set of axioms, applying its rules of inference to these to obtain new expressions that can be added to the
5581562
Computer science as empirical inquiry: symbols and search
Computer science is the study of the phenomena surrounding computers. The founders of this society understood this very well when they called themselves the Association for Computing Machinery. The machine—not just the hardware, but the programmed, living machine—is the organism we study.
6846387
Causality and Model Abstraction
Abstract Much of science and engineering is concerned with characterizing processes by equations describing the relations that hold among parameters of objects and govern their behavior over time. In formal descriptions of processes in terms of parameters and equations, the notion of causality is rarely made explicit. Formal treatments of the foundations of sciences have avoided discussions of causation and spoken only of functional relations among variables. Nevertheless, the notion of causality plays an important role in our understanding of phenomena. Even when we describe the behavior of a system formally in terms of acausal, mathematical relations, we often give an informal, intuitive explanation of why the system behaves the way it does in terms of cause-effect relations. In this paper, we will present an operational definition of causal ordering. The definition allows us to extract causal dependency relations among variables implicit in a model of a system, when a model is represented as a set of acausal, mathematical relations. Our approach is based on the theory of causal ordering first presented by Simon [22]. The paper shows how to use the theory and its extension in reasoning about physical systems. Further, the paper studies the relation of the theory to the problems of model aggregation.
8839735
Internal representation and rule development in object-oriented design
This article proposes a cognitive framework describing the software development process in object-oriented design (OOD) as building internal representations and developing rules. Rule development (method construction) is performed in two problem spaces: a rule space and an instance space. Rules are generated, refined, and evaluated in the rule space by using three main cognitive operations: Infer, Derive, and Evoke. Cognitive activities in the instance space are called mental simulations and are used in conjunction with the Infer operation in the rule space. In an empirical study with college students, we induced different representations to the same problem by using problem isomorphs. Initially, subjects built a representation based on the problem description. As rule development proceeded, the initial internal representation and designed objects were refined, or changed if necessary, to correspond to knowledge gained during rule development. Differences in rule development processes among groups created final designs that are radically different in terms of their level of abstraction and potential reusability. The article concludes by discussing the implications of these results for object-oriented design.
206567160
Special Feature: Prometheus or Pandora: The Influence of Automation on Society
Even though computer technology may challenge one of man's last and most cherished illusions—that he alone is capable of thought—it can also show him how to live in harmony with nature.
10043574
Scientific Model-Building as Search in Matrix Spaces
Many reported discovery systems build discrete models of hidden structure, properties, or processes in the diverse fields of biology, chemistry, and physics. We show that the search spaces underlying many well-known systems are remarkably similar when re-interpreted as search in matrix spaces. A small number of matrix types are used to represent the input data and output models. Most of the constraints can be represented as matrix constraints; most notably, conservation laws and their analogues can be represented as matrix equations. Typically, one or more matrix dimensions grow as these systems consider more complex models after simpler models fail, and we introduce a notation to express this. The novel framework of matrix-space search serves to unify previous systems and suggests how at least two of them can be integrated. Our analysis constitutes an advance toward a generalized account of model-building in science.
11287797
Collaborative Discovery in a Scientific Domain
This study compares Pairs of subjects with Single subjects in a task of discovering scientific laws with the aid of experiments. Subjects solved a molecular genetics task in a computer micro-world (Dunbar, 1993). Pairs were more successful in discovery than Singles and participated more actively in explanatory activities (i.e., entertaining hypotheses and considering alternative ideas and justifications). Explanatory activities were effective for discovery only when the subjects also conducted crucial experiments. Explanatory activities were facilitated when paired subjects made requests of each other for explanation and focused on them. The study extends from individual to collaborative discovery activities the importance to the discovery process of setting goals to find hypotheses and evidence (Dunbar, 1993) and to construct explanations of phenomena and processes encountered in examples (Chi, Bassok, Lewis, & Glaser, 1989). Discovery through collaboration is a common and growing practice in science whose processes have not yet been extensively studied. We do not yet know whether discovery processes are different when people work together, what role discussion plays in collaboration, how researchers entertain hypotheses and conduct experiments when working together or how they handle alternative hypotheses and justifications that arise in discussion. These questions may be approached through historical case studies, field observation, interviews with researchers involved in collaboration, and laboratory experiments. Each approach has its advantages and limitations. This paper follows an experimental approach. We are aware that, although experiments are highly useful for detailed analyses of discovery processes, we need to be cautious in interpreting these data as reflecting actual scientists’ collaborative discovery processes. Over the long run, combining various approaches
8638136
The marketplace of high-performance computing
In this paper we analyze the major trends and changes in the High-Performance Computing (HPC) market place since the beginning of the journal ‘Parallel Computing’. The initial success of vector computers in the 1970s was driven by raw performance. The introduction of this type of computer systems started the area of ‘Supercomputing’. In the 1980s the availability of standard development environments and of application software packages became more important. Next to performance these factors determined the success of MP vector systems, especially at industrial customers. MPPs became successful in the early 1990s due to their better price/performance ratios, which was made possible by the attack of the ‘killer-micros’. In the lower and medium market segments the MPPs were replaced by microprocessor based symmetrical multiprocessor (SMP) systems in the middle of the 1990s. There success formed the basis for the use of new cluster concepts for very high-end systems. In the last few years only the companies which have entered the emerging markets for massive parallel database servers and financial applications attract enough business volume to be able to support the hardware development for the numerical high-end computing market as well. Success in the traditional floating point intensive engineering applications seems to be no longer suAcient for survival in the market. ” 1999 Elsevier Science B.V. All rights reserved.
31930258
How Many Missing Answers Can Be Tolerated by Query Learners?
We consider the model of exact learning using an equivalence oracle and an incomplete membership oracle. In this model, a random subset of the learners membership queries is left unanswered. Our results are as follows. First, we analyze the obvious method for coping with missing answers: search exhaustively through all possible "answer patterns" associated with the unanswered queries. Thereafter, we present two specific concept classes that are efficiently learnable using an equivalence oracle and a (completely reliable) membership oracle, but are provably not polynomially learnable if the membership oracle becomes slightly incomplete. The first class will demonstrate that the aforementioned method of exhaustively searching through all possible answer patterns cannot be substantially improved in general (despite its apparent simplicity). The second class will demonstrate that the incomplete membership oracle can be rendered useless even if it leaves only a fraction 1/poly(n) of all queries unanswered. Finally, we present a learning algorithm for monotone DNF formulas that can cope with a relatively large fraction of missing answers (more than sixty percent), but is as efficient (in terms of run-time and number of queries) as the classical algorithm whose questions are always answered reliably.
5520100
The Theory of Problem Solving
It is now about fifteen years since the first computer programs were written and tested that used the method of heuristic search to solve problems. Dozens of such programs, some designed for specific task domains, others claiming various degrees of generality, have now been described in the literature, and many experiments with their performance have been reported and analysed. It is an appropriate time to ask what has been learned from these experiments about the general theory of problem solving, and to try to summarize the present state of that theory.
36271721
Industrial Application Areas of High-Performance Computing
In 1993, a list of the top 500 supercomputer sites worldwide was made available for the first time. Since then, the Top500 list has been published twice a year. The list allows a detailed and well-founded analysis of the state of high-performance computing (HPC). This article summarizes the recent trends in application areas of HPC systems, focusing on the increase in industrial installations and applications.