{"responseHeader":{"status":0,"QTime":3,"params":{"q":"{!q.op=AND}id:\"99670\"","hl":"true","hl.simple.post":"","hl.fragsize":"5000","fq":"!embargo_tdt:[NOW TO *]","hl.fl":"ocr_t","hl.method":"unified","wt":"json","hl.simple.pre":""}},"response":{"numFound":1,"start":0,"docs":[{"file_name_t":"Gu-Parallel_Algorithms.pdf","thumb_s":"/2f/00/2f005d52a50360d9b883b630641249c6e5caff5e.jpg","oldid_t":"compsci 7783","setname_s":"ir_computersa","restricted_i":0,"format_t":"application/pdf","modified_tdt":"2016-05-25T00:00:00Z","file_s":"/f4/94/f494931467382a9f4eec17295d4a2c9dceb18258.pdf","title_t":"Page 22","ocr_t":"4 a 4-dimensionaP representation, e.g., Ci,j(k,p) (i,j = 0, ... n- 1 are usually referred to as object indexes and k,p = 0, ... , m- 1 are referred to as label indexes).3 The CLP problem to be solved is to determine an assignment or all possible asÂsignments of labels to objects such that for every pair of objects, the corresponding label assignments satisfy the constraints. In other words, a general goal in a CLP is to enforce arc consistency imposed by the relational constraints between the label-pairs of the objects in order to find a (or all possible) complete, unambiguous, and consistent labeling. The CLP models can only be fully appreciated in the context of specific tasks. The CLP model offers three important features that are not available in other AI search models: 1. A great deal of expressive power. A CLP model is sufficiently rich to be able to represent a wide range of information (see Section 1.1.4 for applications). One reason for this significant feature of the CLP model is that the same set of primitives is used to represent both general and specific information. Consequently it deals comfortably with incomplete information. 2. A firm basis for formal semantics. A CLP is sufficiently modular and well-defined so that it has a precise formal semantics, which precisely defines the meaning (logical semantics) and behavior (procedural semantics) of every piece of any given constraint network, which ensures that the CLP definition con-tains no hidden ambiguities or contradictions. 2In a more complicated CLP model, a set of r relational constraints may be used. They can be represented as a 5-dimensional data array, i.e., Ct)k,p) , where i , j = 0, ... , n- 1 are object indexes, q = 0, ... , r- 1 is a constraint type index, and , k, p = 0, ... , m- 1 are label indexes. 3 Since relations are equivalent to predicates and determines constraints, they will be used interchangeably. For example, if R2 is the binary predicate, ~.i represents the corresponding relation for the binary constraints, and Ci,j represents the corresponding binary constraints.","id":99670,"created_tdt":"2016-05-25T00:00:00Z","parent_i":99969,"_version_":1679953745510662144}]},"highlighting":{"99670":{"ocr_t":[]}}}