Sciweavers

2035 search results - page 72 / 407
» On the complexity of stratified logics
Sort
View
IJCAI
2003
15 years 7 months ago
Decidability of SHIQ with Complex Role Inclusion Axioms
Motivated by medical terminology applications, we investigate the decidability of the well known expressive DL, SHIQ, extended with role inclusion axioms (RIAs) of the form R ◦ ...
Ian Horrocks, Ulrike Sattler
JSAC
2006
157views more  JSAC 2006»
15 years 6 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
ICSM
2002
IEEE
15 years 11 months ago
Atomic Architectural Component Recovery for Program Understanding and Evolution
Component recovery and remodularization is a means to get back control on large and complex legacy systems suffering from ad-hoc changes by recovering logical components and restr...
Rainer Koschke
RSCTC
2000
Springer
113views Fuzzy Logic» more  RSCTC 2000»
15 years 9 months ago
Approximation of Information Granule Sets
The aim of the paper is to present basic notions related to granular computing, namely the information granule syntax and semantics as well as the inclusion and closeness (similari...
Andrzej Skowron, Jaroslaw Stepaniuk, James F. Pete...
LPAR
2007
Springer
16 years 9 days ago
Permutative Additives and Exponentials
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
Gabriele Pulcini