A logic semantics for a class of nondeterministic concurrent constraint logic programs

Author

Leung, Ho-fung ; Tong, Bo-Ming

Author_Institution

Dept. of Comput. Sci., Chinese Univ. of Hong Kong, Shatin, Hong Kong

fYear

1994

fDate

14-16 Dec 1994

Firstpage

342

Lastpage

349

Abstract

M.J. Maher (1987) proposed the ALPS class of committed-choice languages, which can be seen as a further development of concurrent logic programming languages in the direction of CLP(X). However, due to the lack of OR-nondeterminism, ALPS is a class of declarative algorithmic programming languages. In this paper, we present the FENG class of concurrent constraint logic programming languages and give its soundness and completeness results. With the novel feature of constraint based nondeterminism, FENG enriches the semantics of the ALPS and CLP(X). One of the features of FENG is that it supports constraint bared nondeterminism. For some class of programs, this improves the efficiency of program execution. FENG reveals a direction for data-parallel implementations of constraint logic programs. This has been confirmed by our experience in design and implementation of Firebird, a restriction of FENG, on the massively parallel machine DECmpp

Keywords

constraint handling; logic programming; logic programming languages; parallel programming; ALPS class; CLP(X); FENG class; Firebird; committed-choice languages; completeness; concurrent logic programming languages; constraint bared nondeterminism; logic semantics; massively parallel machine DECmpp; nondeterministic concurrent constraint logic programs; soundness; Computer languages; Computer science; Concurrent computing; Delay; Electronic mail; Logic programming; Modems; Natural languages; Parallel machines; Yarn;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms and Networks, 1994. (ISPAN), International Symposium on

Conference_Location

Kanazawa

Print_ISBN

0-8186-6507-6

Type

conf

DOI

10.1109/ISPAN.1994.367181

Filename

367181