Knext

Query Results: Checking.n (page 114)

3,407 results in the active KB.

A (type checking algorithm) can be strict.
Logical form
Learned from
2 sentences.
A (type checking algorithm) can be static.
Logical form
Learned from
2 sentences.
Keys may facilitate (compliance checkings).
Logical form
Learned from
2 sentences.
A (checking technique) can be proactive.
Logical form
Learned from
2 sentences.
(Model checking) may be used.
Logical form
Learned from
2 sentences.
A written text may undergo a checking.
Logical form
Learned from
2 sentences.
Languages may be seen during a process of checking of a written text.
Logical form
Learned from
2 sentences.
A technology may be developed in (model checking).
Logical form
Learned from
2 sentences.
(Road traffic) may undergo a checking.
Logical form
Learned from
2 sentences.
A (stability checking problem) can be infinite.
Logical form
Learned from
2 sentences.
Persons may focus on (model checking).
Logical form
Learned from
2 sentences.
Topics may include approaches to (model checking).
Logical form
Learned from
2 sentences.
Persons may use checking.
Logical form
Learned from
2 sentences.
A checking can be compositional.
Logical form
Learned from
2 sentences.
Checkings can be bound.
Logical form
Learned from
2 sentences.

Search

Results returned on 2026-08-04.