Sciweavers

4397 search results - page 63 / 880
» Relational Algebra Operations
Sort
View
LICS
2007
IEEE
15 years 5 months ago
Tractability and learnability arising from algebras with few subpowers
A k-edge operation ϕ on a finite set A is a k + 1-ary operation that satisfies the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....
Pawel M. Idziak, Petar Markovic, Ralph McKenzie, M...
86
Voted
JUCS
2000
76views more  JUCS 2000»
14 years 11 months ago
Mixed Relations as Enriched Semiringal Categories
Abstract: A study of the classes of nite relations as enriched strict monoidal categories is presented in CaS91]. The relations there are interpreted as connections in owchart sche...
Radu Grosu, Dorel Lucanu, Gheorghe Stefanescu
IJCAI
1993
15 years 13 days ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
75
Voted
AAAI
1998
15 years 14 days ago
An Algebra for Cyclic Ordering of 2D Orientations
Wedefine an algebra of ternary relations for cyclic ordering of 2Dorientations. Thealgebra (1) is a refinement of the CYCORDtheory; (2) contains 24 atomic relations, hence 224 gen...
Amar Isli, Anthony G. Cohn
188
Voted
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
15 years 11 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu