scientific article; zbMATH DE number 839556
From MaRDI portal
Publication:4864249
Cited in
(only showing first 100 items - show all)- Counting Answers to Existential Questions
- Graph-theoretic formalization of hybridization in DNA sticker complexes
- Conjunctive query containment with respect to views and constraints
- Functional dependency restricted insertion propagation
- scientific article; zbMATH DE number 2080021 (Why is no real title available?)
- How many variables are needed to express an existential positive query?
- On the complexity of data disjunctions.
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Vertex cover in conflict graphs
- Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
- Combining description logics, description graphs, and rules
- A framework for comparing query languages in their ability to express Boolean queries
- Inf-datalog, Modal Logic and Complexities
- Answering UCQs under updates and in the presence of integrity constraints
- Graph-theoretic formalization of hybridization in DNA sticker complexes
- A theoretical framework for knowledge-based entity resolution
- Foundations of RDF Databases
- Reasoning about nondeterministic and concurrent actions: A process algebra approach
- Repetitions and permutations of columns in the semijoin algebra
- Reactive computing as model generation
- Relational completeness of query languages for annotated databases
- Algebraic databases
- scientific article; zbMATH DE number 1432040 (Why is no real title available?)
- Matching dependencies: semantics and query answering
- Metafinite model theory
- Rewriting queries using views with access patterns under integrity constraints
- Model checking hybrid logics (with an application to semistructured data)
- A Generalization of the Inference Rules for Join Dependencies in Databases
- Fast left Kan extensions using the chase
- Can you answer while you wait?
- On sampling representatives of relational schemas with a functional dependency
- On the expressive power of message-passing neural networks as global feature map transformers
- Optimizing multiset relational algebra queries using weak-equivalent rewrite rules
- A first step towards implementing dynamic algebraic dependences
- Local higher-order fixpoint iteration
- A corrected 5NF definition for relational database design
- On the relation between SPARQL1.1 and Answer Set Programming
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems
- On Tree Substitution Grammars
- scientific article; zbMATH DE number 194562 (Why is no real title available?)
- scientific article; zbMATH DE number 7561463 (Why is no real title available?)
- DNAQL: a query language for DNA sticker complexes
- Decidable containment of recursive queries
- \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets
- Expressive power and succinctness of the positive calculus of binary relations
- Monitoring of temporal first-order properties with aggregations
- Efficient Evaluation of Arbitrary Relational Calculus Queries
- Datalog: Bag Semantics via Set Semantics
- Fragments of Bag Relational Algebra: Expressiveness and Certain Answers
- Rewriting queries using views over monadic database schemas
- Incorporating cardinality constraints and synonym rules into conditional functional dependencies
- Linking Data to Ontologies
- The expressive power of revised Datalog on problems with closure properties
- A Logical Approach to Constraint Satisfaction
- On the expressibility and the computability of untyped queries
- Foundations of ontology-based data access under bag semantics
- Expressive power of SQL.
- A relation-algebraic approach to the ``Hoare logic of functional dependencies
- MODELLING UNCERTAINTY IN MULTIMEDIA DATABASE SYSTEMS: AN EXTENDED POSSIBILISTIC APPROACH
- Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation
- An inductive database system based on virtual mining views
- Conceptual Modeling for Data Integration
- Executable first-order queries in the logic of information flows
- Tractability and intractability of controlled languages for data access
- The navigational power of web browsers
- Inherent complexity of recursive queries
- Counting subset repairs with functional dependencies
- Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates
- Deciding confluence for a simple class of relational transducer networks
- Highly expressive query languages for unordered data trees
- On the data complexity of consistent query answering
- Structural tractability of counting of solutions to conjunctive queries
- Parameterized complexity of completeness reasoning for conjunctive queries
- Representing ontologies using description logics, description graphs, and rules
- scientific article; zbMATH DE number 7471669 (Why is no real title available?)
- Local properties of query languages
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
- The price of query rewriting in ontology-based data access
- Computing possible and certain answers over order-incomplete data
- The Kolmogorov expressive power of Boolean query languages
- From DB-nets to Coloured Petri Nets with Priorities
- The hardness of resilience for nested aggregation query
- Modern Datalog Engines
- Normal forms for connectedness in categories
- Eliminating recursion from monadic datalog programs on trees
- The expressiveness of DAC
- Adding for-loops to first-order logic
- On the complexity of equational problems in CNF
- Magic Sets and their application to data integration
- View-based query answering in description logics: semantics and complexity
- Characterisations of multivalued dependency implication over undetermined universes
- On database query languages for K-relations
- Merging relational database technology with constraint technology
- Revisiting analogical proportions and analogical inference
- Provenance calculus and possibilistic logic: a parallel and a discussion
- Binary equality implication constraints, normal forms and data redundancy
- Towards an algebraic theory of information integration
- Temporal connectives versus explicit timestamps to query temporal databases
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 Q4864249)
