Sciweavers

3238 search results - page 164 / 648
» On the Computational Interpretation of Negation
Sort
View
ICCS
2005
Springer
15 years 12 months ago
Analyzing Conflicts with Concept-Based Learning
A machine learning technique for handling scenarios of interaction between conflicting agents is suggested. Scenarios are represented by directed graphs with labeled vertices (for ...
Boris Galitsky, Sergei O. Kuznetsov, Mikhail V. Sa...
LPAR
1994
Springer
15 years 10 months ago
On Anti-Links
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...
Bernard Becker, Reiner Hähnle, Anavai Ramesh,...
AIML
1998
15 years 7 months ago
A Resolution-Based Decision Procedure for Extensions of K4
Abstract. This paper presents a resolution decision procedure for transitive propositional modal logics. The procedure combines the relational translation method with an ordered ch...
Harald Ganzinger, Ullrich Hustadt, Christoph Meyer...
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 7 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
CRYPTO
2010
Springer
151views Cryptology» more  CRYPTO 2010»
15 years 7 months ago
Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks
Abstract. A cryptographic primitive is leakage-resilient, if it remains secure even if an adversary can learn a bounded amount of arbitrary information about the computation with e...
Yevgeniy Dodis, Krzysztof Pietrzak