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...
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
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...
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...
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...