Sciweavers

1404 search results - page 1 / 281
» Complexity of admissible rules
Sort
View
AML
2007
95views more  AML 2007»
13 years 4 months ago
Complexity of admissible rules
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
Emil Jerábek
AML
2006
87views more  AML 2006»
13 years 4 months ago
On the rules of intermediate logics
If the Visser rules are admissible for an intermediate logic, they form a basis for the admissible rules of the logic. How to characterize the admissible rules of intermediate log...
Rosalie Iemhoff
MMNS
2003
98views Multimedia» more  MMNS 2003»
13 years 6 months ago
Managing Services Quality through Admission Control and Active Monitoring
We propose a lightweight traffic admission control scheme based on on-line monitoring which ensures multimedia services quality both intra-domain and end-to-end. The AC strategy i...
Solange Rito Lima, Paulo Carvalho, Alexandre Santo...
IGPL
2008
85views more  IGPL 2008»
13 years 4 months ago
Independent Bases of Admissible Rules
We show that IPC, K4, GL, and S4, as well as all logics inheriting their admissible rules, have independent bases of admissible rules. Key words: admissible rule, independent basi...
Emil Jerábek
CAMAD
2006
IEEE
13 years 8 months ago
Ensuring IP services consistency through lightweight monitoring-based admission control
Abstract-- This paper evaluates the performance of a distributed and lightweight AC model based on per-class edge-toedge monitoring feedback for ensuring the quality of multiple se...
Solange Rito Lima, Paulo Carvalho, Vasco Freitas