Introduction to the fifth generation

McCorduck, Pamela

doi:10.1145/358172.358177

Cited by 9 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Still within this formal system approach, it is worth mentioning the launch, in 1978, of the ambitious project of the fi fth-generation computer proposed by Japan (Moto-Oka & Stone, 1984;McCorduck, 1983;Warren, 1982). This project aimed to develop a highly parallel computer, capable of making "one gigalips", meaning one billion logical inferences per second (McCorduck, 1983). The basis of the project was logic programming, proposed by Robert Kowalski, in the form of Horn clauses, implemented in the Prolog language.…”

Section: The Era Of Formal Systemsmentioning

confidence: 99%

The Intersection between Linguistic Theories and Computational Linguistics over time

Moreira

Oliveira

Possi

2022

DELTA

View full text Add to dashboard Cite

Recent achievements have turned Computational linguistics into a dynamic research area, and an important field of application development that is being explored by leading technology companies. Despite the advances, there is still much room for improvement to allow humans to interact with computational devices, through natural language, in the same way that humans interact with native speakers of the same language. How to make computers understand or create new metaphors, metonymies or other figures of language? Is it possible to develop natural language systems capable of producing lyrics or poetry on the same level as humans? Can we produce systems capable of assigning new meanings to syntactic elements that are immediately perceived as coherent by humans? In this paper, we account for the evolution of computational linguistics, drawing a parallel with the evolution of linguistic theories and speculating about its research opportunities and foreseeable limitations.

show abstract

Section: The Era Of Formal Systemsmentioning

confidence: 99%

The Intersection between Linguistic Theories and Computational Linguistics over time

Moreira

Oliveira

Possi

2022

DELTA

View full text Add to dashboard Cite

show abstract

“…In this regard we would note one new and particularly powerful programming language, PROLOG (Clocksin & Mellish,198 l), that seems especially suitable for simulations such as those of counseling that might involve the processing of natural language. Although high level languages such as PROLOG are not currently operable on today's generally available microcomputers, future generations of computers (McCorduck, 1983) will likely be capable of using such languages. Regardless, in the same sense that programs that operate on an APPLE I1 computer may require modification to run on Zenith, IBM, EPSON, and TRS computers, the same will be true for CLIENT 1.…”

Section: Technical Notesmentioning

confidence: 99%

CLIENT 1: A Computer Simulation for Use in Counselor Education and Research

Lichtenberg

Hummel²,

Shaffer

1984

Couns Edu & Supervision

View full text Add to dashboard Cite

CLIENT 1 is an interactive program that was designed to simulate client behavior in an initial interview and to provide a standardized environment for training and research on counselor problem-solving strategies. Through interaction with the computerized client, counselors attempt to facilitate client movement toward the goal of verbalizing a specific problem statement. Client movement is a function of the appropriateness and accuracy of counselor statements, the threat value associated with both client and counselor statements, the strength of the relationship between the counselor and client, and an index of counselor expertise. The uses of the simulation in counselor education and research are discussed.People are confronted with problems when they want something and do not know immediately what series of actions they can and should take to get it (Newel1 & Simon, 1972). Within the broad framework of counseling, the concept of a problem takes on a hierarchy of meanings. At the first level of meaning, clients can be seen as having problems-they are confronted with personal, social, educational, and vocational dilemmas for which solutions are desired but for which steps toward the solution are unclear. At the next level of meaning, counselors have problemsspecifically, they are confronted with the problem of determining the appropriate series of actions through which they can help their clients resolve the problems they present. Finally, as counselor educators and supervisors, we may be seen as being confronted with the problem of James W .

show abstract

“…Researches on the future computers, unlike the current computers, are towards the symbolic inference machine that is capable of perfoHming the deductive reasoning over a given knowledge and data [McCo83;Shap83;Moto82], and research projects for designing such an inference machine are under way in the United States, Japan, and France [ICOT84]. There have been two approaches to this problem; one is to build an inference machine that can directly execute the inference procedures of the logic program (PROLOG) such as unifications and deductive searches, producing one answer at a time, and the other is to build the KnowledgeBased System (KBS), i.e., to store a large set of facts in a data base and retrieve these facts as they are searched in the inference process.…”

Section: Introductionmentioning

confidence: 99%

Data flow relation processor for knowledge base machine

Thompson

Shin

1986

Proceedings of the 1986 ACM Fourteenth Annual Conference on Computer Science - CSC '86

View full text Add to dashboard Cite

A PROLOG query to the Knowledge-Based System is evaluated by means of massive join operations. Three approaches of query compilation are discussed. Existing join modules are studied with respect to the time and hardware complexities. Data Flow Relation Processor (DFRP) is a high performance join module which is suitable for joining n consecutive relations, and its function and organization are proposed. In DFRP, only those tuples of two relations that agree on the attribute common to both relations are directly concatenated in parallel.As soon as a concatenated tuple is formed in a PE, it is sent to the next relation. The intermediate results are not formed. The way that DFRP behaves to perform join operations over a large number of relations naturally corresponds to the parallel deductive search and unification of the theorem-proving. Deadend packets in DFRP do not affect the query response time, while the backtracking of the theorem-proving degrades the performance.

show abstract

Introduction to the fifth generation

Cited by 9 publications

References 0 publications

The Intersection between Linguistic Theories and Computational Linguistics over time

The Intersection between Linguistic Theories and Computational Linguistics over time

CLIENT 1: A Computer Simulation for Use in Counselor Education and Research

Data flow relation processor for knowledge base machine

Contact Info

Product

Resources

About