Sciweavers

1684 search results - page 251 / 337
» The lexicographic decision function
Sort
View
SAT
2009
Springer
121views Hardware» more  SAT 2009»
14 years 4 months ago
The Complexity of Reasoning for Fragments of Default Logic
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
TABLEAUX
2009
Springer
14 years 4 months ago
Comparative Concept Similarity over Minspaces: Axiomatisation and Tableaux Calculus
We study the logic of comparative concept similarity CSL introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative similarity comparison. In thi...
Régis Alenda, Nicola Olivetti, Camilla Schw...
SOUPS
2009
ACM
14 years 4 months ago
Conditioned-safe ceremonies and a user study of an application to web authentication
We introduce the notion of a conditioned-safe ceremony. A “ceremony” is similar to the conventional notion of a protocol, except that a ceremony explicitly includes human part...
Chris Karlof, J. D. Tygar, David Wagner
CCGRID
2008
IEEE
14 years 4 months ago
Grid Differentiated Services: A Reinforcement Learning Approach
—Large scale production grids are a major case for autonomic computing. Following the classical definition of Kephart, an autonomic computing system should optimize its own beha...
Julien Perez, Cécile Germain-Renaud, Bal&aa...
CCGRID
2008
IEEE
14 years 4 months ago
Admission Control in a Computational Market
We propose, implement and evaluate three admission models for computational Grids. The models take the expected demand into account and offer a specific performance guarantee. Th...
Thomas Sandholm, Kevin Lai, Scott H. Clearwater