Titlebook: Logic in Databases; International Worksh Dino Pedreschi,Carlo Zaniolo Conference proceedings 1996 Springer-Verlag Berlin Heidelberg 1996 Ak

螺絲刀

書目名稱Logic in Databases影響因子(影響力)




書目名稱Logic in Databases影響因子(影響力)學(xué)科排名




書目名稱Logic in Databases網(wǎng)絡(luò)公開度




書目名稱Logic in Databases網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Logic in Databases被引頻次




書目名稱Logic in Databases被引頻次學(xué)科排名




書目名稱Logic in Databases年度引用




書目名稱Logic in Databases年度引用學(xué)科排名




書目名稱Logic in Databases讀者反饋




書目名稱Logic in Databases讀者反饋學(xué)科排名

脊椎動物

Termination properties of spatial Datalog programs,tial queries must be established by ad-hoc arguments, if it can be established at all. As an illustration of the difficulties that can be encountered in this respect we discuss the topological connectivity query.

Halfhearted

不連貫

An axiomatic interpretation of confidentiality demands in logic-based relational databases,hat many security properties can already be proved from these few axioms. These properties characterise a mandatory-security-policy-conforming database with an unequivocal semantics of the data and a notion of integrity identical to that of relational databases.

defenses

Applying transition rules to bitemporal deductive databases for integrity constraint checking,could violate some integrity contraint. Although, we have a large amount of transition rules, for each one we argue its utility or we eliminate it. We augment a database with this set of transition and event rules and then standard SLDNF resolution can be used to check satisfaction of integrity constraints.

Abjure

Formal characterization of active databases,struct [SZ90] to characterize the non-determinism that arises when several rules can fire at the same time and the preference between them is not specified. We show through examples how our language allows us to express features of different active database systems.

Charitable

Aesthete

Stable model checking for disjunctive logic programs,ynomial time on the class of . and, in case of general disjunctive logic programs, it limits the inefficient part of the computation . to the components of the program which are not head-cycle free. Some optimization techniques are also employed to reduce the amount of computation to be performed in practice.

debouch

TRUST