Sciweavers

11397 search results - page 38 / 2280
» A Relational Abstraction for Functions
Sort
View
ICDIM
2010
IEEE
13 years 7 months ago
High-order functions and their ordering relations
High-order functions are the sole elements in a class of recursive functions. The functions are related to each other through application, i.e., applying a function to an argument...
Kevin H. Xu, Jingsong Zhang, Shelby Gao
FOSSACS
2004
Springer
14 years 3 months ago
Hypergraphs and Degrees of Parallelism: A Completeness Result
Abstract. In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [3, 5]). We introduce the notion of t...
Antonio Bucciarelli, Benjamin Leperchey
JAMDS
2002
60views more  JAMDS 2002»
13 years 9 months ago
A simple proof of Suzumura's extension theorem for finite domains with applications
Abstract. In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extensio...
Somdeb Lahiri
EUSFLAT
2007
131views Fuzzy Logic» more  EUSFLAT 2007»
13 years 11 months ago
Preservation of Graded Properties of Fuzzy Relations by Aggregation Functions
We study graded properties (α–properties) of fuzzy relations, which are parameterized versions of fuzzy relation properties defined by L.A. Zadeh. Namely, we take into account...
Urszula Dudziak
DBA
2004
72views Database» more  DBA 2004»
13 years 11 months ago
Explicit and Implicit LIST Aggregate Function for Relational Databases
We argue for a new aggregate function we termed the LIST function. It aggregates a set of values of one or more attributes into a single value that is internally a list of these v...
Witold Litwin