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)


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
Number of pages12
ISBN (Print)9783540164791
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


Other4th International Conference on Logic Programming, 1985

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'And-or queuing in Extended Concurrent Prolog'. Together they form a unique fingerprint.

Cite this