Well File:
- Well Planning ( results)
- Shallow Hazard Analysis ( results)
- Well Plat ( results)
- Wellbore Schematic ( results)
- Directional Survey ( results)
- Fluid Sample ( results)
- Log ( results)
- Density ( results)
- Gamma Ray ( results)
- Mud ( results)
- Resistivity ( results)
- Report ( results)
- Daily Report ( results)
- End of Well Report ( results)
- Well Completion Report ( results)
- Rock Sample ( results)
Formal languages and their relation to automata
Hopcroft, J. E., Ullman, J. D.
Reading, Mass.: Addison-Wesley.
Probabilistic representation of formal languages
In IEEE Conference Record of the 1969 Tenth Annual Symposium on Switching and Automata Theory, pp. 74–81.
An experiment in automatic induction
In Meltzer, Bernard and Donald Michie (Eds.), Machine Intelligence 5. Edinburgh University Press, pp.203-15.
REALIZATION OF A GENERAL GAME-PLAYING PROGRAM
We study some aspects of a general game-playing program. Such a program receives as data the rules of a game: an algorithm enumerating the moves and an algorithm indicating how to win. The program associates to each move the conditions necessary for this move to occur. It must find how to avoid a dangerous move. We describe the part of the program playing the combinatorial game in order to win: how it can find the moves which lead to victory and what are the only opponent's moves with which he does not lose. This program has been tried with various games: chess, tic-tac-too, etc.INFORMATION PROCESSING 68 - NORTH-HOLLAND PUBLISHING COMPANY - AMSTERDAM
User's guide to QA3
A question-answering system. Tech. Note 15, AI Group, Stanford Research Institute, Menlo Park, Calif.
Pictorial relationships -- a syntactic approach
In Meltzer, Bernard and Donald Michie (Eds.), Machine Intelligence 4. Edinburgh University Press.
Robotologic
In Meltzer, Bernard and Donald Michie (Eds.), Machine Intelligence 5. Edinburgh University Press.
Theorem-proving by resolution as a basis for question answering systems
This paper shows how a question -answering system can be constructed using first -order logic as its language and a resolution -type theorem -prover as its deductive mechanism. A working computer -program, Q A3, based on these ideas is described. The performance of the program compares favorably with several other general question -answering systems.
Heuristic DENDRAL: A Program for Generating Explanatory Hypotheses in Organic Chemistry
Buchanan, B. G., Sutherland, G. L., Feigenbaum, E. A.
"A computer program has been written which can formulate hypotheses from a given set of scientific data. The data consist of the mass spectrum and the empirical formula of an organic chemical compound. The hypotheses which are produced describe molecular structures which are plausible explanations of the data. The hypotheses are generated systematically within the program's theory of chemical stability and within limiting constraints which are inferred from the data by heuristic rules. The program excludes hypotheses inconsistent with the data and lists its candidate explanatory hypotheses in order of decreasing plausibility. The computer program is heuristic in that it searches for plausible hypotheses in a small subset of the total hypothesis space according to heuristic rules learned from chemists."In Meltzer, B., Michie, D., and Swann, M. (Eds.), Machine Intelligence 4, pp. 209-254. Edinburgh University Press