3172 search results - page 242 / 635 » On the Random-Self-Reducibility of Complete Sets |
175
click to vote
DMIN
2006
15 years 8 months ago
2006
This paper presents enhancements to previous algorithms for the sequential extraction of complete non-redundant set of rules from a concept lattice. The aim of these enhancements i...
158
click to vote
DM
2008
15 years 6 months ago
2008
Let G be the set that contains precisely the graphs on n vertices with maximum degree 3 for which there exists a 4-cycle system of their complement in Kn. In this paper G is compl...
150
click to vote
AML
2006
15 years 6 months ago
2006
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
127
click to vote
APAL
2006
15 years 6 months ago
2006
A new modal logic D is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic D is proven to be dec...
142
click to vote
EOR
2008
15 years 6 months ago
2008
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory t...