scientific article; zbMATH DE number 1142327

Cited in

(55)

Local consistency for extended CSPs
Circumscribing DATALOG: expressive power and complexity
Datalog extensions for database queries and updates
The monadic second-order logic of graphs. VII: Graphs as relational structures
Expressive power and complexity of partial models for disjunctive deductive databases
Semantics and expressiveness issues in active databases
The expressive power of stratified logic programs with value invention
On the complexity of database queries
Regular path queries with constraints
Hereditarily-finite sets, data bases and polynomial-time computability
Correctness of fixpoint transformations
Stratified least fixpoint logic
The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
Multiple total stable models are definitely needed to solve unique solution problems
Querying disjunctive databases through nonmonotonic logics
The complexity of concept languages
Metafinite model theory
A first step towards implementing dynamic algebraic dependences
Constrained dependencies
Local and global relational consistency
Minimal-change integrity maintenance using tuple deletions
Thue trees
Alan Day's work on modular and arguesian lattices
Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
A Reiterman theorem for pseudovarieties of finite first-order structures
Using temporal logics to express search control knowledge for planning
A tetrachotomy of ontology-mediated queries with a covering axiom
Characterizing functional dependencies in formal concept analysis with pattern structures
An algebra of database preferences
On a problem of Fagin concerning multivalued dependencies in relational databases
Arity hierarchies
Implication and axiomatization of functional and constant constraints
An algebraic calculus of database preferences
On the consistency problem for modular lattices and related structures
A formal context for acyclic join dependencies
Characterisations of multivalued dependency implication over undetermined universes
scientific article; zbMATH DE number 1985582 (Why is no real title available?)
scientific article; zbMATH DE number 1522507 (Why is no real title available?)
Tarski's influence on computer science
Computing on structures
Proof-theoretic notions for software maintenance
The \theta -Join as a Join with \theta
On the expressibility and the computability of untyped queries
Normal forms and syntactic completeness proofs for functional independencies
Metafinite model theory
Three views on dependency covers from an FCA perspective
The expressiveness of a family of finite set languages
Computing with infinitary logic
A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs
On the equivalence of recursive and nonrecursive Datalog programs
Strongly first order disjunctive embedded dependencies in team semantics
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
On deciding the data complexity of answering linear monadic Datalog queries with ltl operators
Negation in rule-based database languages: A survey
Fundamental properties of deterministic and nondeterministic extensions of Datalog

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385543)