Learn More
With the advent of cost-eeective massively parallel computers, researchers conjecture that the future constraint logic programming system is composed of a massively parallel constraint solver as the back-end with a concurrent inference engine as the front-end Coh90]. This paper represents an attempt to build a constraint logic programming system on a(More)
In 12], we proposed Firebird, a new concurrent constraint programming language 9] which supports both concurrency and data-parallelism. Committed-choice indeterminism and don't know nondeterminism are integrated, but in a manner diierent from the Andorra Model 16]. Instead of nondeterminate clauses, nite domain variables form the basis of don't know(More)
With lhe advent of cost-effective massively parallel computers, researchers conjecture that the future concurrent constraint programmin~ system is composed of a massively parallel constraint solver as the back-end with a concurrent inference engine as the front-end (Cohen, Comm. ACM 33 (7) (1990) 52 68). This paper represents, to the best of our knowledge,(More)
Firebird 12] is a data-parallel concurrent constraint programming system. It is shown that nite domain constraint languages can be implemented on massively parallel SIMD machines. Firebird has been further enhanced with parallel backtracking capability and the design of the Data-Parallel Abstract Machine, the basis of Firebird's implementation, has been(More)
  • 1