4066 search results - page 368 / 814 » Almost Complete Sets |
173
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
Decision making amounts to define a preorder (usually a complete one) on a set of options. Argumentation has been introduced in decision making analysis. In particular, an argumen...
168
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
158
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
171
click to vote
ACSC
2007
IEEE
16 years 1 months ago
2007
IEEE
Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its ...
182
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— For the past decade or so, evolutionary multiobjective optimization (EMO) methodologies have earned wide popularity for solving complex practical optimization problems,...