6 search results - page 1 / 2 » Horn clauses and functional dependencies in complex-value da... |
ADC
2006
Springer
13 years 10 months ago
2006
Springer
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
APLAS
2011
ACM
12 years 4 months ago
2011
ACM
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
FOIKS
2008
Springer
13 years 6 months ago
2008
Springer
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
COMPSAC
1996
IEEE
13 years 8 months ago
1996
IEEE
We present the architecture and design details of a logic database system that extends functionality in a number of ways. The system supports indefinite (non-Horn) facts in extens...
ICAIL
2007
ACM
13 years 8 months ago
2007
ACM
As massive document repositories and knowledge management systems continue to expand, in proprietary environments as well as on the Web, the need for duplicate detection becomes i...