680 search results - page 8 / 136 » Complexity of Strict Implication |
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
IQ
2001
13 years 9 months ago
2001
: Physical and informational works are strongly interrelated in a business process. This facilitates modeling a business process as an integral part of a closed loop information an...
ICCD
2005
IEEE
14 years 4 months ago
2005
IEEE
In this paper, we make two major contributions: First, to enhance Boolean learning, we propose a new class of logic implications called extended forward implications. Using a nove...
AAAI
2008
13 years 10 months ago
2008
In this paper, we present a normal form for concept expressions in the description logic ALC which is based on a recently introduced notion of prime implicate for the modal logic ...
DLOG
1996
13 years 9 months ago
1996
Designing a DL system poses the problem of the trade-o between power of expression and complexity. In spite of their rich expressive capacity, the or and not constructors are usua...