182 search results - page 10 / 37 » A Theory of Strict P-completeness |
ICDT
2012
ACM
11 years 10 months ago
2012
ACM
We introduce a new normal form, called essential tuple normal form (ETNF), for relations in a relational database where the constraints are given by functional dependencies and jo...
ENTCS
2002
13 years 7 months ago
2002
Logics as Dialgebras Alessandra Palmigiano Departament de L`ogica, Hist`oria i Filosofia de la Ci`encia, Universitat de Barcelona The aim of this report is to propose a line of re...
CAD
2007
Springer
13 years 7 months ago
2007
Springer
Defeaturing is a popular CAD/ CAE simplification technique where ‘small or irrelevant features’ are suppressed within a CAD model for speeding-up downstream processes, especia...
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
KR
2004
Springer
14 years 28 days ago
2004
Springer
In a very basic sense, the aim of knowledge discovery is to reveal structures of knowledge which can be seen as being represented by structural relationships. In this paper, we ma...