View in EDS PDF Full Text

First Specialize Then generalize.

Saved in:
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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 12620931
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: First Specialize Then generalize.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Cohen%2C+Jacques%22">Cohen, Jacques</searchLink><relatesTo>1</relatesTo><i> jc@cs.brandeis.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Mar1992, Vol. 35 Issue 3, p34-39. 6p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Logic+programming%22">Logic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+processing%22">Parallel processing</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+architecture%22">Computer architecture</searchLink><br /><searchLink fieldCode="DE" term="%22Prolog+%28Computer+program+language%29%22">Prolog (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+linguistics%22">Computational linguistics</searchLink><br /><searchLink fieldCode="DE" term="%22Information+theory%22">Information theory</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=12620931
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/131295.214842
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 6
        StartPage: 34
    Subjects:
      – SubjectFull: Logic programming
        Type: general
      – SubjectFull: Parallel processing
        Type: general
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: Computer architecture
        Type: general
      – SubjectFull: Prolog (Computer program language)
        Type: general
      – SubjectFull: Computational linguistics
        Type: general
      – SubjectFull: Information theory
        Type: general
    Titles:
      – TitleFull: First Specialize Then generalize.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Cohen, Jacques
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar1992
              Type: published
              Y: 1992
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 35
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1