uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
SLDR-RESOLUTION - PARALLELIZING STRUCTURAL RECURSION IN LOGIC PROGRAMS
Uppsala University.
1995 (English)In: JOURNAL OF LOGIC PROGRAMMING, ISSN 0743-1066, Vol. 25, no 2, 93-117 p.Article in journal (Other scientific) Published
Abstract [en]

We introduce a new operational semantics, SLDR-resolution, for a class of recursive logic programs. We establish the soundness and completeness of SLDR-resolution by showing that one SLDR-resolution inference is equivalent to n greater than or equal to 1

Place, publisher, year, edition, pages
ELSEVIER SCIENCE PUBL CO INC , 1995. Vol. 25, no 2, 93-117 p.
Identifiers
URN: urn:nbn:se:uu:diva-27266OAI: oai:DiVA.org:uu-27266DiVA: diva2:55160
Note
Addresses: MILLROTH H, UNIV UPPSALA, DEPT COMP SCI, BOX 311, S-75105 UPPSALA, SWEDEN.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-16

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 373 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf