MLQ
2010
13 years 11 months ago
2010
We consider logical expressions built on the single binary connector of implication and a finite number of literals (boolean variables and their negations). We prove that asympto...
IPM
2002
14 years 4 days ago
2002
This paper proposes a new approach for classifying text documents into two disjoint classes. The new approach is based on extracting patterns, in the form of two logical expressio...
ISSRE
2003
IEEE
14 years 5 months ago
2003
IEEE
A large number of coverage criteria to generate tests from logical expressions have been proposed. Although there have been large variations in the terminology, the articulation o...