736 search results - page 104 / 148 » A Science of Reasoning (Extended Abstract) |
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
TARK
2005
Springer
14 years 1 months ago
2005
Springer
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighb...
LICS
2003
IEEE
14 years 28 days ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...