SINGLE QUEUE COMPILATION.

Jiro Tanaka, Makoto Kishishita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Extended Concurrent Prolog (ECP) is a variant of Concurrent Prolog (CP) with OR-parallel, set-abstraction and meta-inference features. In this paper, we describe the implementation of ECP 'compiler' by showing how these extended features of ECP can be compiled to a Prolog program. Our ECP compiler has only one scheduling queue to which all the AND-related goals and all the OR-related clauses are enqueued. This scheduling method is designated 'Single Queue Compilation. ' This 'Single Queue Compilation' makes it possible to handle all kinds of AND-relations and OR-relations in a uniform manner.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsBernard Robinet, Reinhard Wilhelm
PublisherSpringer-Verlag
Pages301-314
Number of pages14
ISBN (Print)3540164421
Publication statusPublished - 1986 Dec 1
Externally publishedYes

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743

Fingerprint

Prolog
Compilation
Queue
Scheduling
Concurrent
Compiler

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Tanaka, J., & Kishishita, M. (1986). SINGLE QUEUE COMPILATION. In B. Robinet, & R. Wilhelm (Eds.), Lecture Notes in Computer Science (pp. 301-314). (Lecture Notes in Computer Science). Springer-Verlag.

SINGLE QUEUE COMPILATION. / Tanaka, Jiro; Kishishita, Makoto.

Lecture Notes in Computer Science. ed. / Bernard Robinet; Reinhard Wilhelm. Springer-Verlag, 1986. p. 301-314 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tanaka, J & Kishishita, M 1986, SINGLE QUEUE COMPILATION. in B Robinet & R Wilhelm (eds), Lecture Notes in Computer Science. Lecture Notes in Computer Science, Springer-Verlag, pp. 301-314.
Tanaka J, Kishishita M. SINGLE QUEUE COMPILATION. In Robinet B, Wilhelm R, editors, Lecture Notes in Computer Science. Springer-Verlag. 1986. p. 301-314. (Lecture Notes in Computer Science).
Tanaka, Jiro ; Kishishita, Makoto. / SINGLE QUEUE COMPILATION. Lecture Notes in Computer Science. editor / Bernard Robinet ; Reinhard Wilhelm. Springer-Verlag, 1986. pp. 301-314 (Lecture Notes in Computer Science).
@inproceedings{0da8953a263a46fe9e3f6841f0129596,
title = "SINGLE QUEUE COMPILATION.",
abstract = "Extended Concurrent Prolog (ECP) is a variant of Concurrent Prolog (CP) with OR-parallel, set-abstraction and meta-inference features. In this paper, we describe the implementation of ECP 'compiler' by showing how these extended features of ECP can be compiled to a Prolog program. Our ECP compiler has only one scheduling queue to which all the AND-related goals and all the OR-related clauses are enqueued. This scheduling method is designated 'Single Queue Compilation. ' This 'Single Queue Compilation' makes it possible to handle all kinds of AND-relations and OR-relations in a uniform manner.",
author = "Jiro Tanaka and Makoto Kishishita",
year = "1986",
month = "12",
day = "1",
language = "English",
isbn = "3540164421",
series = "Lecture Notes in Computer Science",
publisher = "Springer-Verlag",
pages = "301--314",
editor = "Bernard Robinet and Reinhard Wilhelm",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - SINGLE QUEUE COMPILATION.

AU - Tanaka, Jiro

AU - Kishishita, Makoto

PY - 1986/12/1

Y1 - 1986/12/1

N2 - Extended Concurrent Prolog (ECP) is a variant of Concurrent Prolog (CP) with OR-parallel, set-abstraction and meta-inference features. In this paper, we describe the implementation of ECP 'compiler' by showing how these extended features of ECP can be compiled to a Prolog program. Our ECP compiler has only one scheduling queue to which all the AND-related goals and all the OR-related clauses are enqueued. This scheduling method is designated 'Single Queue Compilation. ' This 'Single Queue Compilation' makes it possible to handle all kinds of AND-relations and OR-relations in a uniform manner.

AB - Extended Concurrent Prolog (ECP) is a variant of Concurrent Prolog (CP) with OR-parallel, set-abstraction and meta-inference features. In this paper, we describe the implementation of ECP 'compiler' by showing how these extended features of ECP can be compiled to a Prolog program. Our ECP compiler has only one scheduling queue to which all the AND-related goals and all the OR-related clauses are enqueued. This scheduling method is designated 'Single Queue Compilation. ' This 'Single Queue Compilation' makes it possible to handle all kinds of AND-relations and OR-relations in a uniform manner.

UR - http://www.scopus.com/inward/record.url?scp=0022849748&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022849748&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0022849748

SN - 3540164421

T3 - Lecture Notes in Computer Science

SP - 301

EP - 314

BT - Lecture Notes in Computer Science

A2 - Robinet, Bernard

A2 - Wilhelm, Reinhard

PB - Springer-Verlag

ER -