Sciweavers

1404 search results - page 3 / 281
» Complexity of admissible rules
Sort
View
LOGCOM
2010
114views more  LOGCOM 2010»
13 years 8 months ago
Admissible Rules of Lukasiewicz Logic
We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity ...
Emil Jerábek
IGPL
1998
97views more  IGPL 1998»
13 years 9 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
IPPS
1998
IEEE
14 years 2 months ago
An Efficient RMS Admission Control and Its Application to Multiprocessor Scheduling
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks accepted in the system will meet their timing requiremen...
Sylvain Lauzac, Rami G. Melhem, Daniel Mossé...
MONET
2006
88views more  MONET 2006»
13 years 9 months ago
Introducing consciousness in UWB networks by hybrid modelling of admission control
Abstract We formalize a model for a self-organizing network of nodes that operate according to the UWB principle based on hybrid modelling formalism. We design the rules that lead ...
Maria-Gabriella Di Benedetto, Guerino Giancola, Ma...