Results 1 - 10 of 28,877

Reasoning the fast and frugal way: Models of bounded rationality.

by Gerd Gigerenzer , Daniel G Goldstein - Psychological Review, , 1996
"... Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors have ..."
Abstract - Cited by 611 (30 self) - Add to MetaCart
Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

by Phan Minh Dung - Artificial Intelligence , 1995
"... The purpose of this paper is to study the fundamental mechanism humans use in argumentation and its role in different major approaches to commonsense reasoning in AI and logic programming. We present three novel results: We develop a theory for argumentation in which the acceptability of arguments i ..."
Abstract - Cited by 1198 (12 self) - Add to MetaCart
The purpose of this paper is to study the fundamental mechanism humans use in argumentation and its role in different major approaches to commonsense reasoning in AI and logic programming. We present three novel results: We develop a theory for argumentation in which the acceptability of arguments

The inductive approach to verifying cryptographic protocols

by Lawrence C. Paulson - Journal of Computer Security , 1998
"... Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems. Proofs are generated using Isabelle/HOL. The human effort required to analyze a protocol can be as ..."
Abstract - Cited by 480 (29 self) - Add to MetaCart
Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems. Proofs are generated using Isabelle/HOL. The human effort required to analyze a protocol can

Human domination of Earth’s ecosystems

by Peter M. Vitousek, Harold A. Mooney, Jane Lubchenco, Jerry M. Melillo - Science , 1997
"... Human alteration of Earth is substantial and growing. Between one-third and one-half interact with the atmosphere, with aquatic of the land surface has been transformed by human action; the carbon dioxide con- systems, and with surrounding land. Morecentration in the atmosphere has increased by near ..."
Abstract - Cited by 609 (7 self) - Add to MetaCart
be measured more or less straightforwardly at a eiven site, but it is difficult to aggregate these changes regionally and globallv. In contrast to analvses of human al-A11 organisms modify their environment, reasonably well quantified; all are ongoing, teraiion of the global carbon cycle, we and humans

Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,

by ] Richard Hackman , Grec R Oldham , 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract - Cited by 622 (2 self) - Add to MetaCart
in the management literature, in fact little is known about the reasons why "enriched" work sometimes leads to positive outcomes for workers and for their employing organizations. Even less is known about the relative effectiveness of various strategies for carrying out the redesign of work One reason

Testing Game Theory

by Jörgen W. Weibull , 2004
"... Experimentalists frequently claim that human subjects in the laboratory violate game-theoretic predictions. It is here argued that this claim is usually premature. The paper elaborates on this theme by way of raising some conceptual and methodological issues in connection with the very definition of ..."
Abstract - Cited by 1030 (17 self) - Add to MetaCart
Experimentalists frequently claim that human subjects in the laboratory violate game-theoretic predictions. It is here argued that this claim is usually premature. The paper elaborates on this theme by way of raising some conceptual and methodological issues in connection with the very definition

A New Method for Solving Hard Satisfiability Problems

by Bart Selman, Hector Levesque, David Mitchell - AAAI , 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract - Cited by 730 (21 self) - Add to MetaCart
approaches such as the Davis-Putnam procedure or resolution. We also show that GSAT can solve structured satisfiability problems quickly. In particular, we solve encodings of graph coloring problems, N-queens, and Boolean induction. General application strategies and limitations of the approach are also

Extensional versus intuitive reasoning: The conjunction fallacy in probability judgment

by Amos Tversky, Daniel Kahneman - Psychological Review , 1983
"... Perhaps the simplest and the most basic qualitative law of probability is the conjunction rule: The probability of a conjunction, P(A&B), cannot exceed the probabilities of its constituents, P(A) and.P(B), because the extension (or the possibility set) of the conjunction is included in the exten ..."
Abstract - Cited by 461 (6 self) - Add to MetaCart
are discussed and attempts to combat it are explored. Uncertainty is an unavoidable aspect of the the last decade (see, e.g., Einhorn & Hogarth, human condition. Many significant choices must be based on beliefs about the likelihood

A Theory of the Learnable

by L. G. Valiant , 1984
"... Humans appear to be able to learn new concepts without needing to be programmed explicitly in any conventional sense. In this paper we regard learning as the phenomenon of knowledge acquisition in the absence of explicit programming. We give a precise methodology for studying this phenomenon from ..."
Abstract - Cited by 1985 (15 self) - Add to MetaCart
Humans appear to be able to learn new concepts without needing to be programmed explicitly in any conventional sense. In this paper we regard learning as the phenomenon of knowledge acquisition in the absence of explicit programming. We give a precise methodology for studying this phenomenon from

PVS: A Prototype Verification System

by S. Owre, J. M. Rushby, N. Shankar - CADE , 1992
"... PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available. ..."
Abstract - Cited by 655 (16 self) - Add to MetaCart
. It has been used to construct proofs of nontrivial difficulty with relatively modest amounts of human effort. Here, we describe some of the motivation behind PVS and provide some details of the system. Automated reasoning systems typically fall in one of two classes: those that provide powerful
Results 1 - 10 of 28,877