Deductive Databases with Universally Quantified Conditions


This paper presents an extension to deductive databases, called quantified deductive databases, that incorporates universally quantified expressions (in coded form) in the body of rules. Since universally quantified expressions contain negations in their semantics, quantified deductive databases fall under the category of deductive databases with negation… (More)

1 Figure or Table


  • Presentations referencing similar topics