It is important to identify complementtaking nouns in order to properly analyze the grammatical and implicative structure of the sentence. This paper examines the ways in which these nouns were identified and classified for addition to the BRIDGE natural language understanding system.

In this paper, we introduce the concepts of right, left and product stabilizers on hoops and study some properties and the relation between them.  And we try to find that how they can be equal and investigate that under what condition they can be filter, implicative filter, fantastic and positive implicative filter. Also, we prove that  right and product stabilizers are filters and if they are ...

In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...

This paper proposes an efficient algorithm for the systematic learning of implications. This is done as part of a new search and restart strategy in the SAT solver. We evaluate the new algorithm within a number of applications, including BMC and induction with invariant strengthening for equivalence checking. We provide extensive experimental evidence attesting to a speedup of one and often two...