And-or queuing in Extended Concurrent Prolog

Jiro Tanaka, Takashi Yokomori, Makoto Kishishita

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

1 Citation (Scopus)

Abstract

We have modified Concurrent Prolog (CP) Interpreter (Shapiro 1983) and implemented Extended Concurrent Prolog (ECP) Interpreter (Fujitsu 1985), which has OR-parallel, set-abstraction and meta-inference facilities. In Shapiro's CP interpreter only the AND-related goals are enqueued to the scheduling queue. None of OR-related clauses is dealt with. However, our ECP interpreter 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 “AND-OR queuing.” AND-OR queuing makes it possible to handle all kinds of AND-relations and OR-relations in a uniform manner.

Original languageEnglish
Title of host publicationLogic Programming '85 - Proceedings of the 4th Conference
PublisherSpringer-Verlag
Pages156-167
Number of pages12
ISBN (Print)9783540164791
DOIs
Publication statusPublished - 1986 Jan 1
Externally publishedYes
Event4th International Conference on Logic Programming, 1985 - Tokyo, Japan
Duration: 1985 Jul 11985 Jul 3

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume221 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Conference on Logic Programming, 1985
CountryJapan
CityTokyo
Period85/7/185/7/3

Fingerprint

Queuing
Prolog
Concurrent
Scheduling
Queue

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Tanaka, J., Yokomori, T., & Kishishita, M. (1986). And-or queuing in Extended Concurrent Prolog. In Logic Programming '85 - Proceedings of the 4th Conference (pp. 156-167). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 221 LNCS). Springer-Verlag. https://doi.org/10.1007/3-540-16479-0_16

And-or queuing in Extended Concurrent Prolog. / Tanaka, Jiro; Yokomori, Takashi; Kishishita, Makoto.

Logic Programming '85 - Proceedings of the 4th Conference. Springer-Verlag, 1986. p. 156-167 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 221 LNCS).

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

Tanaka, J, Yokomori, T & Kishishita, M 1986, And-or queuing in Extended Concurrent Prolog. in Logic Programming '85 - Proceedings of the 4th Conference. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 221 LNCS, Springer-Verlag, pp. 156-167, 4th International Conference on Logic Programming, 1985, Tokyo, Japan, 85/7/1. https://doi.org/10.1007/3-540-16479-0_16
Tanaka J, Yokomori T, Kishishita M. And-or queuing in Extended Concurrent Prolog. In Logic Programming '85 - Proceedings of the 4th Conference. Springer-Verlag. 1986. p. 156-167. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-16479-0_16
Tanaka, Jiro ; Yokomori, Takashi ; Kishishita, Makoto. / And-or queuing in Extended Concurrent Prolog. Logic Programming '85 - Proceedings of the 4th Conference. Springer-Verlag, 1986. pp. 156-167 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ee5382f41794433ba65684f18a7dab52,
title = "And-or queuing in Extended Concurrent Prolog",
abstract = "We have modified Concurrent Prolog (CP) Interpreter (Shapiro 1983) and implemented Extended Concurrent Prolog (ECP) Interpreter (Fujitsu 1985), which has OR-parallel, set-abstraction and meta-inference facilities. In Shapiro's CP interpreter only the AND-related goals are enqueued to the scheduling queue. None of OR-related clauses is dealt with. However, our ECP interpreter 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 “AND-OR queuing.” AND-OR queuing makes it possible to handle all kinds of AND-relations and OR-relations in a uniform manner.",
author = "Jiro Tanaka and Takashi Yokomori and Makoto Kishishita",
year = "1986",
month = "1",
day = "1",
doi = "10.1007/3-540-16479-0_16",
language = "English",
isbn = "9783540164791",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "156--167",
booktitle = "Logic Programming '85 - Proceedings of the 4th Conference",

}

TY - GEN

T1 - And-or queuing in Extended Concurrent Prolog

AU - Tanaka, Jiro

AU - Yokomori, Takashi

AU - Kishishita, Makoto

PY - 1986/1/1

Y1 - 1986/1/1

N2 - We have modified Concurrent Prolog (CP) Interpreter (Shapiro 1983) and implemented Extended Concurrent Prolog (ECP) Interpreter (Fujitsu 1985), which has OR-parallel, set-abstraction and meta-inference facilities. In Shapiro's CP interpreter only the AND-related goals are enqueued to the scheduling queue. None of OR-related clauses is dealt with. However, our ECP interpreter 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 “AND-OR queuing.” AND-OR queuing makes it possible to handle all kinds of AND-relations and OR-relations in a uniform manner.

AB - We have modified Concurrent Prolog (CP) Interpreter (Shapiro 1983) and implemented Extended Concurrent Prolog (ECP) Interpreter (Fujitsu 1985), which has OR-parallel, set-abstraction and meta-inference facilities. In Shapiro's CP interpreter only the AND-related goals are enqueued to the scheduling queue. None of OR-related clauses is dealt with. However, our ECP interpreter 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 “AND-OR queuing.” AND-OR queuing 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=84934540844&partnerID=8YFLogxK

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

U2 - 10.1007/3-540-16479-0_16

DO - 10.1007/3-540-16479-0_16

M3 - Conference contribution

SN - 9783540164791

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 156

EP - 167

BT - Logic Programming '85 - Proceedings of the 4th Conference

PB - Springer-Verlag

ER -