Sciweavers

3353 search results - page 215 / 671
» Laver and set theory
Sort
View
FUIN
2007
121views more  FUIN 2007»
15 years 6 months ago
A Possibility-Theoretic View of Formal Concept Analysis
Abstract. The paper starts from the standard relational view linking objects and properties in formal concept analysis, here augmented with four modal-style operators (known as suf...
Didier Dubois, Florence Dupin de Saint-Cyr, Henri ...
IANDC
2007
133views more  IANDC 2007»
15 years 6 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
Alexander Rabinovich
TCS
2010
15 years 4 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink
ICML
2003
IEEE
16 years 7 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...
SAGT
2009
Springer
177views Game Theory» more  SAGT 2009»
16 years 1 months ago
Characterizing Incentive Compatibility for Convex Valuations
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
André Berger, Rudolf Müller, Seyed Hos...