7289 search results - page 309 / 1458 » A Dependent Set Theory |
184
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
193
click to vote
ICLP
2007
Springer
16 years 27 days ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
172
click to vote
ENTCS
2007
15 years 6 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
196
click to vote
EUSFLAT
2009
15 years 4 months ago
2009
In this paper we consider physical systems and the concept of their states in the context of the theory of fuzzy sets and systems. In section 1 we give a brief sketch on the fundam...
180
click to vote
JSYML
2008
15 years 6 months ago
2008
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...