View in EDS PDF Full Text

Lazy List Comprehension in Logic Programming.

Saved in:
Bibliographic Details
Title: Lazy List Comprehension in Logic Programming.
Authors: ELBL, BIRGIT1 birgit@informatik.unibw-muenchen.de
Source: Journal of Logic & Computation. Oct2002, Vol. 12 Issue 5, p747-771. 25p.
Subjects: Programming languages, Horn clauses, Finite differences, Semantics, Comprehension, Axioms
Abstract: The pure prolog evaluation of a goal yields a list of answers, but the tools provided for manipulating these structures are very poor. We discuss augmenting pure prolog with a list comprehension construct that offers the possibility of referring to the finite or infinite list of answers produced. Thus meta-predicates can be defined. A substructural calculus is used to give an axiomatic semantics to the extended language. Soundness and completeness of the intended evaluation with respect to this semantics is proved. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 45280313
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Lazy List Comprehension in Logic Programming.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22ELBL%2C+BIRGIT%22">ELBL, BIRGIT</searchLink><relatesTo>1</relatesTo><i> birgit@informatik.unibw-muenchen.de</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Computation%22">Journal of Logic & Computation</searchLink>. Oct2002, Vol. 12 Issue 5, p747-771. 25p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Horn+clauses%22">Horn clauses</searchLink><br /><searchLink fieldCode="DE" term="%22Finite+differences%22">Finite differences</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Comprehension%22">Comprehension</searchLink><br /><searchLink fieldCode="DE" term="%22Axioms%22">Axioms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The pure prolog evaluation of a goal yields a list of answers, but the tools provided for manipulating these structures are very poor. We discuss augmenting pure prolog with a list comprehension construct that offers the possibility of referring to the finite or infinite list of answers produced. Thus meta-predicates can be defined. A substructural calculus is used to give an axiomatic semantics to the extended language. Soundness and completeness of the intended evaluation with respect to this semantics is proved. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=45280313
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1093/logcom/12.5.747
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 25
        StartPage: 747
    Subjects:
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: Horn clauses
        Type: general
      – SubjectFull: Finite differences
        Type: general
      – SubjectFull: Semantics
        Type: general
      – SubjectFull: Comprehension
        Type: general
      – SubjectFull: Axioms
        Type: general
    Titles:
      – TitleFull: Lazy List Comprehension in Logic Programming.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: ELBL, BIRGIT
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: Oct2002
              Type: published
              Y: 2002
          Identifiers:
            – Type: issn-print
              Value: 0955792X
          Numbering:
            – Type: volume
              Value: 12
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: Journal of Logic & Computation
              Type: main
ResultId 1