### Table 1: Logical constraints

### Table 1: Logical constraints

### Table 12: Resolving E ect Constraints 22 The Journal of Functional and Logic Programming 1997-5

### Table 3. (Taken from [104, 106]) Complexity of Disjunctive Logic Programs (with Integrity Constraints)

### Table 3. Fundamental IS program constraints

2007

"... In PAGE 7: ... We have elected the Prolog programming language to capture these specifications. Table3 shows a code extract describing some constraints of our IS program. Table 3.... ..."

### Table 6: Comparison matrix for maintaining logical constraints.

"... In PAGE 8: ... Because Berkeley DB lacks many of the more refined mechanisms for maintaining logical constraints it is deemed inferior to the other DBMSs. Table6 details the comparison matrix for the DBMSs abilities to maintain ... ..."

### Table 12: Constraint Programming results.

1998

"... In PAGE 27: ... It can be seen that usually only a few seconds are needed by the Tabu code to find a solution a solution as good as that found by the LP heuristic. For purposes of comparison, in Table12 we reproduce the best results obtained by the Constraint Programming algorithm of Heipcke and Colombani ([16]) as reported in [6]. The columns LB and UB represent respectively the lower and upper bounds produced by the algorithm while column Cr.... ..."

Cited by 10

### Table 2.1: LP and Logic Constraints.

### Table 6: Comparison of best results obtained with TSSPLC and Constraint Logic Program- ming approaches. The results are in the form (TSSPLC solution, CLP solution).

1997

"... In PAGE 21: ... This con rms the observation that the initial solution quality has an impact on the performance of tabu search. The Table6 presents the comparison of the results obtained in our implementation of TSSPLC with the best ones generated by a Constraint Logic Programming approach to SPLC [HC97]. It can be veri ed that for all instances the makespan obtained by TSSPLC is less than or equals to the makespan generated with the Constraint Logic Programming algorithm described in [HC97].... ..."

### Table 2. Comparison of the feasible region of LP-QDMC and single QDMC strategy.

1980

Cited by 1