Sciweavers

1404 search results - page 2 / 281
» Complexity of admissible rules
Sort
View
LOGCOM
2010
135views more  LOGCOM 2010»
13 years 7 months ago
Bases of Admissible Rules of Lukasiewicz Logic
We construct explicit bases of single-conclusion and multiple-conclusion admissible rules of propositional Lukasiewicz logic, and we prove that every formula has an admissibly sat...
Emil Jerábek
LFCS
2009
Springer
14 years 3 months ago
Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
The admissible rules of a logic are those rules under which the set of theorems of the logic is closed. In a previous paper by the authors, formal systems for deriving the admissib...
Rosalie Iemhoff, George Metcalfe
TWC
2010
13 years 3 months ago
A novel CAC scheme for homogeneous 802.11 networks
This paper proposes a new call admission control (CAC) scheme for one-hop homogeneous 802.11 DCF networks. Using the proposed scheme, we can perform admission control quickly and e...
Qinglin Zhao, Danny H. K. Tsang, Taka Sakurai
ADT
2008
13 years 8 months ago
A service-oriented admission control strategy for class-based IP networks
The clear trend toward the integration of current and emerging applications and services in the Internet launches new demands on service deployment and management. Distributed serv...
Solange Rito Lima, Paulo Carvalho, Vasco Freitas
ENTCS
2010
119views more  ENTCS 2010»
13 years 8 months ago
A Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...