925 search results - page 27 / 185 » Connectivity on Complete Lattices |
158
click to vote
PASTE
1998
ACM
15 years 10 months ago
1998
ACM
Concept analysis transforms any relation between ‘lobjects” and “attributes” into a complete lattice. This concept lattice can be studied by algebraic means and offers rem...
158
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
123
click to vote
IJCAI
1989
15 years 7 months ago
1989
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou sand time-tokens in demanding applications su...
130
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
113
click to vote
FSS
2006
15 years 6 months ago
2006
Abstract. We show a complete axiomatization of unary connectives interpreted by monotone and superdiagonal truth functions, so-called truth-depressing hedges. These connectives for...