You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Generating Abstraction Hierarchies presents a completely automated approach to generating abstractions for problem solving. The abstractions are generated using a tractable, domain-independent algorithm whose only inputs are the definition of a problem space and the problem to be solved and whose output is an abstraction hierarchy that is tailored to the particular problem. The algorithm generates abstraction hierarchies that satisfy the `ordered monotonicity' property, which guarantees that the structure of an abstract solution is not changed in the process of refining it. An abstraction hierarchy with this property allows a problem to be decomposed such that the solution in an abstract spa...
Change of Representation and Inductive Bias One of the most important emerging concerns of machine learning researchers is the dependence of their learning programs on the underlying representations, especially on the languages used to describe hypotheses. The effectiveness of learning algorithms is very sensitive to this choice of language; choosing too large a language permits too many possible hypotheses for a program to consider, precluding effective learning, but choosing too small a language can prohibit a program from being able to find acceptable hypotheses. This dependence is not just a pitfall, however; it is also an opportunity. The work of Saul Amarel over the past two decades ha...
"The central fact is that we are planning agents." (M. Bratman, Intentions, Plans, and Practical Reasoning, 1987, p. 2) Recent arguments to the contrary notwithstanding, it seems to be the case that people-the best exemplars of general intelligence that we have to date do a lot of planning. It is therefore not surprising that modeling the planning process has always been a central part of the Artificial Intelligence enterprise. Reasonable behavior in complex environments requires the ability to consider what actions one should take, in order to achieve (some of) what one wants and that, in a nutshell, is what AI planning systems attempt to do. Indeed, the basic description of a plan generation algorithm has remained constant for nearly three decades: given a desciption of an initial state I, a goal state G, and a set of action types, find a sequence S of instantiated actions such that when S is executed instate I, G is guaranteed as a result. Working out the details of this class of algorithms, and making the elabora tions necessary for them to be effective in real environments, have proven to be bigger tasks than one might have imagined.
The purpose of our research is to enhance the efficiency of AI problem solvers by automating representation changes. We have developed a system that improves the description of input problems and selects an appropriate search algorithm for each given problem. Motivation. Researchers have accumulated much evidence on the impor tance of appropriate representations for the efficiency of AI systems. The same problem may be easy or difficult, depending on the way we describe it and on the search algorithm we use. Previous work on the automatic im provement of problem descriptions has mostly been limited to the design of individual learning algorithms. The user has traditionally been responsible f...
The proceedings of the Second International Conference on [title] held in Cambridge, Massachusetts, April 1991, comprise 55 papers on topics including the logical specifications of reasoning behaviors and representation formalisms, comparative analysis of competing algorithms and formalisms, and ana
"Knowledge commons" describes the institutionalized community governance of the sharing and, in some cases, creation, of information, science, knowledge, data, and other types of intellectual and cultural resources. It is the subject of enormous recent interest and enthusiasm with respect to policymaking about innovation, creative production, and intellectual property. Taking that enthusiasm as its starting point, Governing Knowledge Commons argues that policymaking should be based on evidence and a deeper understanding of what makes commons institutions work. It offers a systematic way to study knowledge commons, borrowing and building on Elinor Ostrom's Nobel Prize-winning research on natural resource commons. It proposes a framework for studying knowledge commons that is adapted to the unique attributes of knowledge and information, describing the framework in detail and explaining how to put it into context both with respect to commons research and with respect to innovation and information policy. Eleven detailed case studies apply and discuss the framework exploring knowledge commons across a wide variety of scientific and cultural domains.
Proceedings held May 1989. Topics include temporal logic, hierarchical knowledge bases, default theories, nonmonotonic and analogical reasoning, formal theories of belief revision, and metareasoning. Annotation copyright Book News, Inc. Portland, Or.
Castel Ivano, originally built in 1375, is one of many beautiful and impressive castles strategically placed atop hills in Trentino's Valsugana in Northern Italy. It was in this castle on a series of brilliant sunny crisp November days in 1990 that an international group of computer scientists and cognitive scientists met at a workshop to discuss theoretical and applied issues concerning communi cation from an Artificial Intelligence and Cognitive Science perspective. About forty people, representing nine countries, participated in the workshop, either as speakers, discussants, or observers. The main motivationfor the workshop wasto address the questionofwhether and how current computational...
The proceedings of KR '94 comprise 55 papers on topics including deduction an search, description logics, theories of knowledge and belief, nonmonotonic reasoning and belief revision, action and time, planning and decision-making and reasoning about the physical world, and the relations between KR