### Table I. Experimental results of shape constraint based visual positioning method.

### Table 1. Constraint based execution of even/odd

"... In PAGE 6: ... Finally, sb is the abbreviation of sub- sumed. In the initial state ((0) in Table1 ) the only clause is the query. The leftmost atom of a program predicate is selected and the two clauses de n- ing even/1 are activated (1).... ..."

### Table 1. Constraint based execution of even/odd

1998

"... In PAGE 8: ... Finally, sb is the abbreviation of sub- sumed. In the initial state ((0) in Table1 ) the only clause is the query. The leftmost atom of a program predicate is selected and the two clauses de n- ing even/1 are activated (1).... ..."

### Table 2: Comparison with Constraint-based Testing.

1999

Cited by 15

### Table 8 : Constraint-based interaction

1995

Cited by 1

### Table 4. Graphs for ReducedTransitivity Constraints. Results are given for the three different methods of encoding transitivity constraints based on the variables in the true support of Fsat.

2000

"... In PAGE 11: ... We compute Fsat ^ Ftrans( ^ E+) and, if it is satisfiable, generate a coun- terexample. Table4 shows the complexity of the graphs generated by this method for our bench- mark circuits. Comparing these with the full graphs shown in Table 2, we see that we... ..."

Cited by 30

### Table 4: Graphs for Reduced Transitivity Constraints. Results are given for the three different methods of encoding transitivity constraints based on the variables in the true support of Fsat.

2000

"... In PAGE 21: ... We compute Fsat ^ Ftrans( ^ E+) and, if it is satisfiable, generate a counterexample. Table4 shows the complexity of the graphs generated by this method for our benchmark cir- cuits. Comparing these with the full graphs shown in Table 2, we see that we typically reduce the number of relational vertices (i.... ..."

Cited by 30

### Table 4: Graphs for Reduced Transitivity Constraints. Results are given for the three different methods of encoding transitivity constraints based on the variables in the true support of F sat.

2000

"... In PAGE 21: ... We compute F sat ^ F trans#28 ^ E + #29 and, if it is satisfiable, generate a counterexample. Table4 shows the complexity of the graphs generated by this method for our benchmark cir- cuits. Comparing these with the full graphs shown in Table 2, we see that we typically reduce the number of relational vertices (i.... ..."

Cited by 30