3009 search results - page 199 / 602 » The Expressive Rate of Constraints |
192
click to vote
MOZ
2004
Springer
15 years 12 months ago
2004
Springer
The analysis of biochemical networks consists in studying the interactions between biological entities cooperating in complex cellular processes. To facilitate the expression of an...
150
click to vote
SAT
2004
Springer
15 years 12 months ago
2004
Springer
The paper studies the use of global unobservability constraints in a CNF translation of Boolean formulas, where the unobservability of logic blocks is encoded with CNF unobservabil...
171
click to vote
DBPL
2007
Springer
15 years 10 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
177
click to vote
BIS
2008
15 years 8 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
157
click to vote
TPLP
2008
15 years 6 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...