Sciweavers

63 search results - page 11 / 13
» The Bounded Axiom A Forcing Axiom
Sort
View
SAT
2007
Springer
118views Hardware» more  SAT 2007»
14 years 2 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
TCS
2008
13 years 8 months ago
Information systems revisited - the general continuous case
In this paper a new notion of continuous information system is introduced. It is shown that the information systems of this kind generate exactly the continuous domains. The new i...
Dieter Spreen, Luoshan Xu, Xuxin Mao
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
14 years 3 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme
KR
2004
Springer
14 years 1 months ago
Discovering State Invariants
We continue to advocate a methodology that we used earlier for pattern discovery through exhaustive search in selected small domains. This time we apply it to the problem of disco...
Fangzhen Lin
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
14 years 24 days ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar