scispace - formally typeset
Search or ask a question

Showing papers on "Heuristic published in 1968"


Book ChapterDOI
TL;DR: In this paper, several changes in the problem of inductive logic have been discussed, and a solution of weak justification has been proposed, which leaves the discovery, the growth of knowledge untouched.
Abstract: Publisher Summary This chapter discusses several changes in the problem of inductive logic. There are two main problems of classical empiricism: inductive justification and inductive method. Classical epistemology in general is characterized by its two main problems: (1) the problem of the foundations of—epistemic, that is, perfect, infallible—knowledge (the logic of justification); and (2) the problem of the growth of—perfect, well-founded—knowledge or the problem of heuristic, or of method (the logic of discovery). The classical twin problems of induction were the justification of theories, and the discovery of theories from facts. Carnap's neoclassical solution provides at best a solution of the problem of weak justification. However, it leaves the problem of discovery, the problem of the growth of knowledge, untouched.

197 citations


Journal ArticleDOI
TL;DR: It is hoped that the heuristic program discussed searches for a constructive proof or disproof of a given proposition and uses a search procedure which efficiently selects the seemingly best proposition to work on next.
Abstract: The heuristic program discussed searches for a constructive proof or disproof of a given proposition. It uses a search procedure which efficiently selects the seemingly best proposition to work on next. This program is multipurpose in that the domains it can handle are varied.As an initial experiment, the program was given the task of searching for proofs and disproofs of propositions about kalah end games. Kalah is a two-person game. In another experiment the program, after some modifications, played the game of kalah. This program was compared with another tree-searching procedure, the Alpha-Beta minimax procedure; the results have been encouraging since the program is fast and efficient. Its greatest usefulness is in solving large problems. It is hoped that this program has added one more step toward the goal of eventually obtaining computer programs which can solve intellectually difficult problems.

57 citations




Journal ArticleDOI
TL;DR: The model is constructed to perform four modes of control: 1) probing, 2) gradient, 3) heuristic, and 4) terminal, which simulates the function of a human operator in a control system and the evolution of heuristics for control.
Abstract: This paper presents a mathematical model for decision making in control systems. The model is constructed to perform four modes of control: 1) probing, 2) gradient, 3) heuristic, and 4) terminal. The operation of the model switches from one mode to another by following certain decision logic, which simulates the function of a human operator in a control system and the evolution of heuristics for control. The simulation results compare favorably with the data obtained from experiments with subjects.

8 citations


01 May 1968
TL;DR: A Heuristic computer program producing detailed timelines for each crewman used to derive multipurpose manned space station requirements.
Abstract: Heuristic computer program producing detailed timelines for each crewman used to derive multipurpose manned space station requirements

1 citations