scispace - formally typeset
Search or ask a question
Author

Nils J. Nilsson

Bio: Nils J. Nilsson is an academic researcher from Stanford University. The author has contributed to research in topics: Inference & First-order logic. The author has an hindex of 37, co-authored 90 publications receiving 28751 citations. Previous affiliations of Nils J. Nilsson include SRI International & Artificial Intelligence Center.


Papers
More filters
Book ChapterDOI
01 Jan 1987
TL;DR: In this article, a generalization of logic in which truth values can take on values intermediate between true and false has been studied for reasoning with uncertain beliefs, where an agent may realize that not only does it merely believe P instead of knowing P, but that it does not believe P strongly.
Abstract: This chapter describes the reasoning with uncertain beliefs. There are circumstances in which it would not be appropriate for an agent to invest its beliefs with total commitment. An agent may realize that not only does it merely believe P instead of knowing P , but that it does not believe P strongly. There are many situations in which humans possess and reason with uncertain beliefs. In searching for ways to formalize the idea of beliefs having strengths, one are tempted to consider a generalization of logic in which truth values can take on values intermediate between true and false. To believe P with total commitment is to assign it the value true. To disbelieve P totally is to assign P the value false. Inventing truth values between true and false allows for various degrees of partial belief. Multivalued logics have been studied sometimes with this application in mind.

2 citations

Book ChapterDOI
01 Jan 1998

2 citations

Book
01 Apr 1989
TL;DR: Artificial Intelligence, as a maturing scientific/engineering discipline, is beginning to find its niche among the variety of subjects that are relevant to intelligent, perceptive behavior.
Abstract: Artificial Intelligence, as a maturing scientific/engineering discipline, is beginning to find its niche among the variety of subjects that are relevant to intelligent, perceptive behavior. A view of AI is presented that is based on a declarative representation of knowledge with semantic attachments to problem-specific procedures and data structures. Several important challenges to this view are briefly discussed It is argued that research in the field would be stimulated by a project to develop a computer individual that would have a continuing existence in time THOSE OF US engaged in artificial intelligence research have the historically unique privilege of asking and answering the most profound scientific and engineering questions that people have ever set for themselves-questions about the nature of those processes that separate us humans from the rest of the universe-namely intelligence, reason, perception, self-awareness, and language. It is clear-to most of us in AI, at least-that our field, perhaps together with molecular genetics, will be society’s predominant scientific endeavor for the rest of this century and well into the next-just as physics and chemistry predominated during the decades before and after 1900. The preoccupation of the physical sciences was, if you like, with This article is based on the author’s Presidential Address given at the Annual Meeting of the American Association for Artificial Intelligence on August 11, 1983 in Washington, D.C the machine code of the universe. We in AI are now moving on to the higher level processes. AI has made an excellent beginning toward understanding these processes. Two measures of the health of the field are the many AI applications that are now being reported and the almost-weekly announcements of new AI companies being formed to develop and market these applications. AI is finally beginning to “earn its way.” Although I will briefly comment later about applications, I want to concentrate on the maturation of AI as a serious scientific/engineering discipline. In the tradition of previous addresses by AAAI Presidents, I have decided not to attempt to present a consensual or averaged view of the important matters concerning our field; instead I will deliver some personal opinions. I trust that discerning readers and the growth processes of AI as a scientific field will provide sufficient filtering of these and other views.

2 citations

Journal ArticleDOI
TL;DR: Describes AI ideas based on general computational concepts involving the kind of data structures used, the types of operations performed on these data structures, and the properties of control strategies used by AI systems.
Abstract: Describes AI ideas based on general computational concepts involving the kind of data structures used, the types of operations performed on these data structures, and the properties of control strategies used by AI systems. The book is designed as a text

2 citations


Cited by
More filters
Book
01 Jan 1988
TL;DR: Probabilistic Reasoning in Intelligent Systems as mentioned in this paper is a complete and accessible account of the theoretical foundations and computational methods that underlie plausible reasoning under uncertainty, and provides a coherent explication of probability as a language for reasoning with partial belief.
Abstract: From the Publisher: Probabilistic Reasoning in Intelligent Systems is a complete andaccessible account of the theoretical foundations and computational methods that underlie plausible reasoning under uncertainty. The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic. The author distinguishes syntactic and semantic approaches to uncertainty—and offers techniques, based on belief networks, that provide a mechanism for making semantics-based systems operational. Specifically, network-propagation techniques serve as a mechanism for combining the theoretical coherence of probability theory with modern demands of reasoning-systems technology: modular declarative inputs, conceptually meaningful inferences, and parallel distributed computation. Application areas include diagnosis, forecasting, image interpretation, multi-sensor fusion, decision support systems, plan recognition, planning, speech recognition—in short, almost every task requiring that conclusions be drawn from uncertain clues and incomplete information. Probabilistic Reasoning in Intelligent Systems will be of special interest to scholars and researchers in AI, decision theory, statistics, logic, philosophy, cognitive psychology, and the management sciences. Professionals in the areas of knowledge-based systems, operations research, engineering, and statistics will find theoretical and computational tools of immediate practical use. The book can also be used as an excellent text for graduate-level courses in AI, operations research, or applied probability.

15,671 citations

Journal ArticleDOI
TL;DR: This historical survey compactly summarizes relevant work, much of it from the previous millennium, review deep supervised learning, unsupervised learning, reinforcement learning & evolutionary computation, and indirect search for short programs encoding deep and large networks.

14,635 citations

Book
John R. Koza1
01 Jan 1992
TL;DR: This book discusses the evolution of architecture, primitive functions, terminals, sufficiency, and closure, and the role of representation and the lens effect in genetic programming.
Abstract: Background on genetic algorithms, LISP, and genetic programming hierarchical problem-solving introduction to automatically-defined functions - the two-boxes problem problems that straddle the breakeven point for computational effort Boolean parity functions determining the architecture of the program the lawnmower problem the bumblebee problem the increasing benefits of ADFs as problems are scaled up finding an impulse response function artificial ant on the San Mateo trail obstacle-avoiding robot the minesweeper problem automatic discovery of detectors for letter recognition flushes and four-of-a-kinds in a pinochle deck introduction to biochemistry and molecular biology prediction of transmembrane domains in proteins prediction of omega loops in proteins lookahead version of the transmembrane problem evolutionary selection of the architecture of the program evolution of primitives and sufficiency evolutionary selection of terminals evolution of closure simultaneous evolution of architecture, primitive functions, terminals, sufficiency, and closure the role of representation and the lens effect Appendices: list of special symbols list of special functions list of type fonts default parameters computer implementation annotated bibliography of genetic programming electronic mailing list and public repository

13,487 citations

Journal ArticleDOI
TL;DR: Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis.
Abstract: Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

13,246 citations

Journal ArticleDOI
TL;DR: This paper describes a mechanism for defining ontologies that are portable over representation systems, basing Ontolingua itself on an ontology of domain-independent, representational idioms.

12,962 citations