4066 search results - page 132 / 814 » Almost Complete Sets |
152
click to vote
TARK
2007
Springer
16 years 15 days ago
2007
Springer
This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogenous priors. An equilibrium of a complete ...
161
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
157
click to vote
WRLA
2010
15 years 4 months ago
2010
Abstract. If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorit...
163
click to vote
VL
2007
IEEE
16 years 20 days ago
2007
IEEE
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
160
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empir...