Pages that link to "Item:Q1776402"

The following pages link to Minimal-change integrity maintenance using tuple deletions (Q1776402):

Displaying 39 items.

• On the data complexity of consistent query answering (Q269317) (← links)
• Mining approximate interval-based temporal dependencies (Q329410) (← links)
• Extending inclusion dependencies with conditions (Q386615) (← links)
• Prioritized repairing and consistent query answering in relational databases (Q454141) (← links)
• Probabilistic query answering over inconsistent databases (Q454142) (← links)
• First-order under-approximations of consistent query answers (Q518631) (← links)
• A framework for reasoning under uncertainty based on non-deterministic distance semantics (Q541819) (← links)
• Simplified forms of computerized reasoning with distance semantics (Q545150) (← links)
• A dichotomy in the complexity of consistent query answering for queries with two atoms (Q763497) (← links)
• Magic Sets and their application to data integration (Q882436) (← links)
• First-order query rewriting for inconsistent databases (Q882438) (← links)
• On the complexity of sampling query feedback restricted database repair of functional dependency violations (Q896157) (← links)
• Disjunctive databases for representing repairs (Q987484) (← links)
• A remark on the complexity of consistent conjunctive query answering under primary key violations (Q1675764) (← links)
• Expressive power of entity-linking frameworks (Q1740667) (← links)
• Magic sets for disjunctive Datalog programs (Q1761296) (← links)
• On the complexity and approximability of repair position selection problem (Q2051902) (← links)
• General information spaces: measuring inconsistency, rationality postulates, and complexity (Q2075379) (← links)
• Database repair via event-condition-action rules in dynamic logic (Q2103906) (← links)
• Inconsistency-tolerant query answering for existential rules (Q2124462) (← links)
• Counting and enumerating preferred database repairs (Q2193286) (← links)
• Distance-based paraconsistent logics (Q2270429) (← links)
• On the complexity of inconsistency measurement (Q2321337) (← links)
• Policy-based inconsistency management in relational databases (Q2353971) (← links)
• On the data complexity of consistent query answering over graph databases (Q2361352) (← links)
• Deductive databases for computing certain and consistent answers from mediated data integration systems (Q2386182) (← links)
• From causes for database queries to repairs and model-based diagnosis and back (Q2402617) (← links)
• On repairing and querying inconsistent probabilistic spatio-temporal databases (Q2406905) (← links)
• A three-valued semantics for querying and repairing inconsistent databases (Q2426103) (← links)
• Distance semantics for database repair (Q2457795) (← links)
• Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? (Q2946755) (← links)
• Reasoning with Uncertainty by Nmatrix–Metric Semantics (Q3511449) (← links)
• Querying incomplete data over extended ER schemata (Q3577711) (← links)
• Taming primary key violations to query large inconsistent data via ASP (Q4593009) (← links)
• (Q5091116) (← links)
• Consistent query answering via ASP from different perspectives: Theory and practice (Q5299585) (← links)
• Complexity thresholds in inclusion logic (Q5925562) (← links)
• An epistemic approach to model uncertainty in data-graphs (Q6137843) (← links)
• On measuring inconsistency in definite and indefinite databases with denial constraints (Q6161468) (← links)