Pages that link to "Item:Q555772"

The following pages link to Data exchange: semantics and query answering (Q555772):

Displaying 46 items.

• Efficient core computation in data exchange (Q3546361) (← links)
• Data exchange: getting to the core (Q3549128) (← links)
• Querying incomplete data over extended ER schemata (Q3577711) (← links)
• Data Privacy for $\mathcal{ALC}$ Knowledge Bases (Q3605544) (← links)
• (Q4558528) (← links)
• Algebraic data integration (Q4577809) (← links)
• Finite model reasoning over existential rules (Q4592706) (← links)
• Checking termination of bottom-up evaluation of logic programs with function symbols (Q4593017) (← links)
• SOME MODEL THEORY OF GUARDED NEGATION (Q4647097) (← links)
• Datalog and Its Extensions for Semantic Web Databases (Q4647813) (← links)
• Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues (Q4911144) (← links)
• Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation (Q4957206) (← links)
• Characterizing Boundedness in Chase Variants (Q4957209) (← links)
• MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations (Q5038471) (← links)
• (Q5091112) (← links)
• Datalog: Bag Semantics via Set Semantics (Q5091129) (← links)
• (Q5091130) (← links)
• A Single Approach to Decide Chase Termination on Linear Existential Rules (Q5091131) (← links)
• (Q5094143) (← links)
• A Logic Framework for P2P Deductive Databases (Q5108527) (← links)
• A Fuzzy Extension of Data Exchange (Q5230063) (← links)
• Reasoning on anonymity in Datalog (Q5240228) (← links)
• Schema Mappings: A Case of Logical Dynamics in Database Theory (Q5249666) (← links)
• The Impact of Active Domain Predicates on Guarded Existential Rules (Q5268437) (← links)
• Disjunctive logic programs with existential quantification in rule heads (Q5398295) (← links)
• Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments (Q5398308) (← links)
• Combining decidability paradigms for existential rules (Q5398317) (← links)
• Information-Optimal Reflections of View Updates on Relational Database Schemata (Q5445297) (← links)
• Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context (Q5504585) (← links)
• Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data (Q5738985) (← links)
• (Q6060097) (← links)
• Temporal Minimal-World Query Answering over Sparse ABoxes (Q6063880) (← links)
• Answer Counting under Guarded TGDs (Q6076172) (← links)
• The notion of abstraction in ontology-based data management (Q6080649) (← links)
• On the k-Boundedness for Existential Rules (Q6104757) (← links)
• Restricted Chase Termination: A Hierarchical Approach and Experimentation (Q6104760) (← links)
• Polynomial combined first-order rewritings for linear and guarded existential rules (Q6108762) (← links)
• Feferman-vaught decompositions for prefix classes of first order logic (Q6117143) (← links)
• Uniform Restricted Chase Termination (Q6156026) (← links)
• A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases (Q6163648) (← links)
• Early detection of temporal constraint violations (Q6178450) (← links)
• Mimicking behaviors in separated domains (Q6488799) (← links)
• Explanation-friendly query answering under uncertainty (Q6535981) (← links)
• Reasoning on property graphs with graph generating dependencies (Q6554875) (← links)
• Controlled query evaluation in description logics through consistent query answering (Q6592995) (← links)
• Reasoning with ontologies (Q6602220) (← links)