scientific article; zbMATH DE number 1142327
From MaRDI portal
Publication:4385543
zbMath0900.68090MaRDI QIDQ4385543
Publication date: 14 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (53)
Correctness of fixpoint transformations ⋮ Stratified least fixpoint logic ⋮ The monadic second order logic of graphs. VI: On several representations of graphs by relational structures ⋮ Implication and axiomatization of functional and constant constraints ⋮ On a problem of Fagin concerning multivalued dependencies in relational databases ⋮ Multiple total stable models are definitely needed to solve unique solution problems ⋮ Querying disjunctive databases through nonmonotonic logics ⋮ An Algebraic Calculus of Database Preferences ⋮ A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ Alan Day's work on modular and arguesian lattices ⋮ The complexity of concept languages ⋮ Unnamed Item ⋮ Hierarchies in transitive closure logic, stratified Datalog and infinitary logic ⋮ A Reiterman theorem for pseudovarieties of finite first-order structures ⋮ Metafinite model theory ⋮ Circumscribing DATALOG: expressive power and complexity ⋮ A first step towards implementing dynamic algebraic dependences ⋮ The $$\theta $$-Join as a Join with $$\theta $$ ⋮ Constrained dependencies ⋮ Local and global relational consistency ⋮ On the consistency problem for modular lattices and related structures ⋮ Three views on dependency covers from an FCA perspective ⋮ Characterisations of multivalued dependency implication over undetermined universes ⋮ Tarski’s Influence on Computer Science ⋮ Datalog extensions for database queries and updates ⋮ Computing on structures ⋮ Unnamed Item ⋮ Using temporal logics to express search control knowledge for planning ⋮ 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 ⋮ The monadic second-order logic of graphs. VII: Graphs as relational structures ⋮ Metafinite model theory ⋮ A closed-form evaluation for Datalog queries with integer (gap)-order constraints ⋮ Characterizing functional dependencies in formal concept analysis with pattern structures ⋮ Proof-theoretic notions for software maintenance ⋮ On the expressibility and the computability of untyped queries ⋮ Minimal-change integrity maintenance using tuple deletions ⋮ Normal forms and syntactic completeness proofs for functional independencies ⋮ A Formal Context for Acyclic Join Dependencies ⋮ Negation in rule-based database languages: A survey ⋮ Fundamental properties of deterministic and nondeterministic extensions of Datalog ⋮ 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 ⋮ Local consistency for extended CSPs ⋮ Arity hierarchies ⋮ On the complexity of database queries ⋮ Regular path queries with constraints ⋮ Hereditarily-finite sets, data bases and polynomial-time computability ⋮ An algebra of database preferences ⋮ Thue trees
This page was built for publication:
