We analyze the complexity of subsumption in probabilistic variants of the description logic EL. In the case where probabilities apply only to concepts, we map out the borderline be...
—With the wide utilization of Petri nets, many researchers suggest that Petri nets should be reused and shared. Emerging the Semantic Web technologies, such as ontologies, can pl...
ion is a critical concept that underlies many topics in computing science. For example, in software engineering, the distinction between a component’s behavior and its implement...
Object-oriented languages such as Java, Smalltalk, and C++ structure their programs using packages, allowing classes to be organized into named abstractions. Maintainers of large ...
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...