A study on parallel semantics of constraint logic programs

This paper presents two parallel semantics of constraint logic programs: multiset answer constraint semantics and game semantics, which differ entirely from the traditional semantics. When giving the first semantics, it adopts the s-semantics approach, whose aim is to find notions of models which really capture the operational semantics. And it defines the program equivalence based on multiset answer constraint. Then it investigates the game semantics and proves that it is consistent with traditional operational semantics. On the basis of these two semantics, programmers can comprehend the programs deeply and develop more sound parallel constraint logic programming systems. Finally, it gives the conclusions and future work.