Bibliographic Details
| Title: |
First Specialize Then generalize. |
| Authors: |
Cohen, Jacques1 jc@cs.brandeis.edu |
| Source: |
Communications of the ACM. Mar1992, Vol. 35 Issue 3, p34-39. 6p. |
| Subjects: |
Logic programming, Parallel processing, Programming languages, Computer architecture, Prolog (Computer program language), Computational linguistics, Information theory |
| Abstract: |
The article presents four articles on issues concerning logic programming (LP) and its various related concepts. The first article presents a summary of the history of LP. The author of this article provides novel presentations of unification and resolution based on the possibility of implementing the basic operations using massively parallel architectures. The second article throws light into the basic theorems relating declarative, procedural, and fixpoint semantics applicable to the class of Prolog-like languages. The introduction of negation in Prolog represents a first step towards generalizing Polya's related problem back to the more ambitious problem of full first order predicate calculus. The third article discusses the role of LP in Japan's ambitious Fifth Generation Project. The article stresses the application aspects of concurrent variants and extensions of logic programming. The fourth article focuses on three topics, firstly the bottom-evaluation of logic programs, secondly, the optimization and parallelization of logic programs and thirdly, on partial evaluation. |
| Database: |
Engineering Source |
