4218 search results - page 172 / 844 » Complete sets of cooperations |
AAAI
2004
13 years 11 months ago
2004
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
UAI
2001
13 years 11 months ago
2001
We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability ...
SCN
2008
Springer
13 years 10 months ago
2008
Springer
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
JUCS
2010
13 years 8 months ago
2010
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
CHI
2006
ACM
14 years 10 months ago
2006
ACM
We explore how the placement of control widgets (such as menus) affects collaboration and usability for co-located tabletop groupware applications. We evaluated two design alterna...