Applying Transition Rules to Bitemporal Deductive Databases for Integrity Constraint Checking

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0031738
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Checking Integrity Constraints in Deductive Systems Based on Production Rules and a Description Logic Terminology

2004English

On Modal Deductive Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Integrity Constraint Enforcement in a Multidatabase Using Distributed Active Rules

1998English

On the Unification of Active Databases and Deductive Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Deductive Databases and Knowledge Base Systems.

1995English

Foundations of Aggregation in Deductive Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

A Logical Foundation for Deductive Object-Oriented Databases

2001English

Proving Finite Satisfiability of Deductive Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1988English

Deductive Rules in Holographic Reduced Representation

Neurocomputing
Computer Science ApplicationsArtificial IntelligenceCognitive Neuroscience
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy