And-or queuing in Extended Concurrent Prolog

Jiro Tanaka; Takashi Yokomori; Makoto Kishishita

doi:10.1007/3-540-16479-0_16

And-or queuing in Extended Concurrent Prolog

Jiro Tanaka, Takashi Yokomori, Makoto Kishishita

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Logic Programming '85 - Proceedings of the 4th Conference
Publisher	Springer-Verlag
Pages	156-167
Number of pages	12
ISBN (Print)	9783540164791
DOIs	https://doi.org/10.1007/3-540-16479-0_16
Publication status	Published - 1986 Jan 1
Externally published	Yes
Event	4th International Conference on Logic Programming, 1985 - Tokyo, Japan Duration: 1985 Jul 1 → 1985 Jul 3

Publication series

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

Other

Other	4th International Conference on Logic Programming, 1985
Country/Territory	Japan
City	Tokyo
Period	85/7/1 → 85/7/3

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-16479-0_16

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 proceeding › Conference 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

@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 = jan,

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",

note = "4th International Conference on Logic Programming, 1985 ; Conference date: 01-07-1985 Through 03-07-1985",

}

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

AN - SCOPUS:84934540844

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

T2 - 4th International Conference on Logic Programming, 1985

Y2 - 1 July 1985 through 3 July 1985

ER -

And-or queuing in Extended Concurrent Prolog

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this