Affordable Access

Publisher Website

On derived dependencies and connected databases

Authors
Journal
The Journal of Logic Programming
0743-1066
Publisher
Elsevier
Publication Date
Volume
11
Issue
2
Identifiers
DOI: 10.1016/0743-1066(91)90017-j
Disciplines
  • Computer Science
  • Logic

Abstract

Abstract This paper introduces a new class of deductive databases ( connected databases) for which SLDNF-resolution never flounders and always computes ground answers. The class of connected databases properly includes that of allowed databases. Moreover the definition of connected databases enables evaluable predicates to be included in a uniform way. An algorithm is described which, for each predicate defined in a normal database, derives a propositional formula ( groundness formula) describing dependencies between the arguments of that predicate. Groundness formulae are used to determine whether a database is connected. They are also used to identify goals for which SLDNF-resolution will never flounder and will always compute ground answers on a connected database.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Partial dependencies in relational databases and t...

on Discrete Applied Mathematics Jan 01, 1992

Discovering branching and fractional dependencies...

on Data & Knowledge Engineering Jan 01, 2008

Cylindric structures and dependencies in relationa...

on Theoretical Computer Science Jan 01, 2001
More articles like this..