### Tableau From Lemma 3, an algorithm that constructs a tableau for an ALCI R + -concept D can be used as a decision procedure for the satisfiability of D. Such an algorithm will now be

1999

Cited by 100

### Table 1: Results of the incomplete decision procedure Summarizing, we note that the procedure is not designed to handle some spe- cial case where plan validation is tractable. Although this is not surprising given our observations in the previous sections, it nevertheless provides a characteriza- tion of this procedure. In the case that only unconditional actions are of interest, the procedure is incomplete. One of the open problems we see here|as with other incomplete decision procedures|is to give an easy to understand charac- terization of when the procedure is complete and when and why incompleteness arises.

1994

Cited by 26

### Table 1. PDF apos;s of the decision statistics for the three imaging procedures

"... In PAGE 6: ... On the other hand, most of the target energy is concentrated in the considered hyperbolic slice, as can be seen from Figure 3, so the resulting performance loss is minimal (and the computational gain realized by restricting to a single hyperbolic slice is signi cant). Table1 summarizes the distributions of the three test statistics considered in this section.... ..."

### Table 4 summarizes the most important decision criteria concerning data collection procedures.

"... In PAGE 26: ... Table4 : Decisions concerning data collection procedures 6. 2.... ..."

### Table 4. Function Complementaryclassical(F ;A; A; Q0; Q) 8 Whereas in the rst-order case all treated logics are not decidable, i.e. there is no decision procedure, the propositional part of each logic is decidable.

1996

Cited by 22

### Table III. Comparison among the schemes for combining/augmenting decision procedures im- plemented within the general setting (n/i means \not implemented quot;; ? means that the scheme terminated on the conjecture but failed to prove or disprove it; cpu time is given in seconds).

1997

Cited by 2

### Table 1. A successful completion sequence for a fragment of group theory4 R1 = [ i 0 \ j iRj Then, a completion sequence is fair if the critical peaks formed with the persisting rules are all reducible with respect to the rewrite rules on proofs. This is in particular so, if the corresponding critical pairs have been computed, but this may not be always necessary. If success occurs after a nite number n of steps, then the resulting system is a decision procedure for E0. In case of divergence, a semi-decision procedure can be obtained if the completion sequence is fair:

1995

Cited by 14

### Table 1. Abbreviations of the different versions produced by the various axes and parameters Look Ahead Procedure Ordered Var Decisions Heuristic Branching Literal Heuristic

2006

Cited by 1

### Table 2. Decision variables and final values in 3 steps temperature optimization using SQP procedure and objective function (8)

"... In PAGE 3: ...Table2... ..."