Data exchange: semantics and query answering
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2088752 (Why is no real title available?)
- scientific article; zbMATH DE number 1182735 (Why is no real title available?)
- scientific article; zbMATH DE number 1953133 (Why is no real title available?)
- scientific article; zbMATH DE number 1953134 (Why is no real title available?)
- scientific article; zbMATH DE number 2241907 (Why is no real title available?)
- A Proof Procedure for Data Dependencies
- Answering queries using views: A survey
- CONVERT
- Horn clauses and database dependencies
- Inclusion dependencies and their interaction with functional dependencies
- On monadic NP vs monadic co-NP
- On the foundations of the universal relation model
- Recursive query plans for data integration
- The complexity of querying indefinite data about linearly ordered domains
- The complexity of satisfiability problems
- The core of a graph
- Why Horn formulas matter in computer science: initial structures and generic examples
Cited in
(only showing first 100 items - show all)- Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
- Magic Sets and their application to data integration
- On the data complexity of consistent query answering
- On rules with existential variables: walking the decidability line
- Schema mapping coverage
- Data exchange beyond complete data
- Tractable XML data exchange via relations
- Combining Consistency and Confidentiality Requirements in First-Order Databases
- Towards knowledge exchange: state-of-the-art and open problems
- A sound and complete model-generation procedure for consistent and confidentiality-preserving databases
- Query optimization in information integration
- A more general theory of static approximations for conjunctive queries
- Semi-oblivious chase termination: the sticky case
- Semantic acyclicity for conjunctive queries: approximations and constraints
- On the data complexity of consistent query answering over graph databases
- Query answering over inconsistent knowledge bases: a probabilistic approach
- Mimicking behaviors in separated domains
- Checking termination of bottom-up evaluation of logic programs with function symbols
- Information-based distance measures and the canonical reflection of view updates
- Querying incomplete information in RDF with SPARQL
- Disjunctive logic programs with existential quantification in rule heads
- Universal solutions for temporal data exchange
- Data Privacy for $\mathcal{ALC}$ Knowledge Bases
- A Single Approach to Decide Chase Termination on Linear Existential Rules
- Logic and data exchange: which solutions are ``good solutions?
- Preference-based inconsistency-tolerant query answering under existential rules
- Characterisations of multivalued dependency implication over undetermined universes
- Limits of schema mappings
- Reasoning about integrity constraints for tree-structured data
- Data exchange and schema mappings in open and closed worlds
- Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin
- Fuzzy data exchange
- scientific article; zbMATH DE number 1953133 (Why is no real title available?)
- Relaxed notions of schema mapping equivalence revisited
- Towards more expressive ontology languages: the query answering problem
- Combining decidability paradigms for existential rules
- Information-Optimal Reflections of View Updates on Relational Database Schemata
- First-order query rewriting for inconsistent databases
- Reasoning about functional and full hierarchical dependencies over partial relations
- Probabilistic data exchange
- A fuzzy extension of data exchange
- Querying regular graph patterns
- Solutions and query rewriting in data exchange
- On simplification of schema mappings
- Inconsistency-tolerant query answering for existential rules
- Solutions in XML data exchange
- Semantic query optimization in the presence of types
- The language of plain SO-tgds: composition, inversion and structural properties
- Logical foundations of information disclosure in ontology-based data integration
- Knowledge base exchange: the case of OWL 2 QL
- scientific article; zbMATH DE number 7561463 (Why is no real title available?)
- scientific article; zbMATH DE number 7561477 (Why is no real title available?)
- Towards practical feasibility of core computation in data exchange
- XML data exchange
- Terminating evaluation of logic programs with finite three-valued models
- Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
- SOME MODEL THEORY OF GUARDED NEGATION
- Inseparability and conservative extensions of description logic ontologies: a survey
- Efficient core computation in data exchange
- Query languages for data exchange: beyond unions of conjunctive queries
- Data exchange: getting to the core
- Answer Counting under Guarded TGDs
- Craig interpolation with clausal first-order tableaux
- Controlled query evaluation in description logics through consistent query answering
- Querying incomplete data over extended ER schemata
- Foundations of information integration under bag semantics
- Update translation in instance mapped heterogeneous peer databases
- On the k-Boundedness for Existential Rules
- Restricted Chase Termination: A Hierarchical Approach and Experimentation
- Algebraic data integration
- Reasoning on property graphs with graph generating dependencies
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
- Temporal Minimal-World Query Answering over Sparse ABoxes
- Exact learning of lightweight description logic ontologies
- Feferman-vaught decompositions for prefix classes of first order logic
- A logic framework for P2P deductive databases
- Logic programming with function symbols: checking termination of bottom-up evaluation through program adornments
- Reasoning with ontologies
- MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations
- Early detection of temporal constraint violations
- Explanation-friendly query answering under uncertainty
- Preserving constraints with the stable chase
- XML schema mappings, data exchange and metadata management
- Polynomial combined first-order rewritings for linear and guarded existential rules
- Datalog and Its Extensions for Semantic Web Databases
- scientific article; zbMATH DE number 7566070 (Why is no real title available?)
- scientific article; zbMATH DE number 7760478 (Why is no real title available?)
- Reasoning on anonymity in Datalog
- Game-based notions of locality over finite models
- The notion of abstraction in ontology-based data management
- Restricted chase termination for existential rules: a hierarchical approach and experimentation
- Characterizing boundedness in chase variants
- The impact of active domain predicates on guarded existential rules
- Foundations of ontology-based data access under bag semantics
- Schema mappings: a case of logical dynamics in database theory
- Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
- On the interaction of existential rules and equality constraints in ontology querying
- The Semantics of Consistency and Trust in Peer Data Exchange Systems
- Bounds in ontology-based data access via circuit complexity
- Uniform Restricted Chase Termination
This page was built for publication: Data exchange: semantics and query answering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555772)
