Country
7 things you didn't probably know about artificial intelligence
AI or artificial intelligence is a field of computer science that's been relevant ever since the first computer was created back in the 1930s. Over the years, we have seen countless AI applications in both the social and technological aspects of our lives, but there is a still a significant part of this rapidly growing field that is unknown to most people. We will go over 7 things you didn't know about artificial intelligence that could be affecting your life right now. Do you ever wonder why you have to figure out all the CAPTCHAs to identify yourself? Well, back in 1950, Sir Alan Turing devised a test to determine if the user taking the test is either a computer or a human.
COMPUTER SOLUTION OF CALCULUS WORD PROBLEMS
A program was writte n to solve calculus word problems. The program, CARPS (CAlculus Rate Problem Solver), is restricte d to rate problems. The overall plan of the program is simila r to Bobrow's STUDENT, the primary difference being the introductio n of "structures " as the internal model in CARPS. Structures are stored internally as trees, each structure holding the information gathered about one object.In Walker, D. E. & Norton, L. N. (eds. ), IJCAI 1969: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, May 7-9, 1969 Washington, D. C., pp. 241-252
PLANNER: a language for proving theorems in robots
PLANNER is a language for proving theorems and manipulating models in a robot. The language is built out of a number of problem solving primitives together with a hierarchical control structure. Statements can be asserted and perhaps later withdrawn as the state of the world changes. Conclusions can be drawn from these various changes in state. Goals can be established and dismissed when they are satisfied . The deductive system of PLANNER is subordinate to the hierarchical control structure in order to make the language efficient . The use of a general purpose matching language makes the deductive system more powerful. In IJCAI-69, pp. 295-ยย301.
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.