Sciweavers

2035 search results - page 10 / 407
» On the complexity of stratified logics
Sort
View
INFOCOM
1999
IEEE
15 years 2 months ago
An Architecture for Noncooperative QoS Provision in Many-Switch Systems
With the proliferation of high-speed networks and networked services, provisioning differentiated services to a diverse user base with heterogeneous QoS requirements has become an ...
Shaogang Chen, Kihong Park
BMCBI
2010
164views more  BMCBI 2010»
14 years 10 months ago
Investigating the validity of current network analysis on static conglomerate networks by protein network stratification
Background: A molecular network perspective forms the foundation of systems biology. A common practice in analyzing protein-protein interaction (PPI) networks is to perform networ...
Minlu Zhang, Long J. Lu
SEMWEB
2007
Springer
15 years 4 months ago
Logical Foundations of (e)RDF(S): Complexity and Reasoning
Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms ...
Jos de Bruijn, Stijn Heymans
CORR
2008
Springer
120views Education» more  CORR 2008»
14 years 10 months ago
On the Complexity of Elementary Modal Logics
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
Edith Hemaspaandra, Henning Schnoor
70
Voted
FLOPS
2008
Springer
14 years 11 months ago
Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
Susana Nieva, Jaime Sánchez-Hernánde...