Titlebook: Deductive and Object-Oriented Databases; Third International Stefano Ceri,Katsumi Tanaka,Shalom Tsur Conference proceedings 1993 Springer-

蒙太奇

Datalog with non-deterministic choice computes ,,augmented with the dynamic choice expresses exactly the non deterministic time-polynomial queries. We thus obtain a complete characterization of the expressiveness of the dynamic choice, and conversely achieve a characterization of the class of queries . by means of a simple, declarative and efficiently implementable language.

變化無常

灰姑娘

An implementation overview of the Aditi deductive database system,valuation of logical queries involving recursion. The front-end interacts with the user in a logical language that has more expressive power than relational query languages. We present the structure of Aditi, discuss its components in some detail, and present performance figures.

xanthelasma

凝乳

orthodox

小步舞

On efficient reasoning with implication constraints, as the .. We show that several other important problems, such as the query containment problem, are polynomially equivalent to the IC-refuting problem. More importantly, we give criteria for designing a set of implication constraints so that an efficient process, called “units-refutation” process can be used to solve the IC-refuting problem.

混沌

耐寒

坦白