Proving Finite Satisfiability of Deductive Databases

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-50241-6_28
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

On Modal Deductive Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

On the Unification of Active Databases and Deductive Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Foundations of Aggregation in Deductive Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Deductive Databases and Knowledge Base Systems.

1995English

A Logical Foundation for Deductive Object-Oriented Databases

2001English

Semantics and Expressive Power of Nondeterministic Constructs in Deductive Databases

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2001English

A Characterization of the Partial Stable Models for Disjunctive Deductive Databases

1997English

Uncertainty and Partial Non-Uniform Assumptions in Parametric Deductive Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

A Materialized View for the Same Generation Query in Deductive Databases

Computer and Information Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy