Pages that link to "Item:Q4815028"
From MaRDI portal
The following pages link to Answer sets for consistent query answering in inconsistent databases (Q4815028):
Displaying 50 items.
- On the data complexity of consistent query answering (Q269317) (← links)
- Data cleaning and query answering with matching dependencies and matching functions (Q359881) (← links)
- Belief revision within fragments of propositional logic (Q386044) (← links)
- Extending inclusion dependencies with conditions (Q386615) (← links)
- Bounded repairability of word languages (Q394744) (← links)
- Repairing XML functional dependency violations (Q424778) (← links)
- Prioritized repairing and consistent query answering in relational databases (Q454141) (← links)
- Probabilistic query answering over inconsistent databases (Q454142) (← links)
- Finding explanations of inconsistency in multi-context systems (Q460632) (← links)
- Repairing inconsistent answer set programs using rules of thumb: a gene regulatory networks case study (Q518622) (← links)
- On the finite controllability of conjunctive query answering in databases under open-world assumption (Q532372) (← 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 sound and complete model-generation procedure for consistent and confidentiality-preserving databases (Q549726) (← links)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
- A dichotomy in the complexity of consistent query answering for queries with two atoms (Q763497) (← links)
- First-order query rewriting for inconsistent databases (Q882438) (← links)
- World-set decompositions: Expressiveness and efficient algorithms (Q944380) (← links)
- Reasoning with prioritized information by iterative aggregation of distance functions (Q959055) (← links)
- Disjunctive databases for representing repairs (Q987484) (← links)
- Incorporating cardinality constraints and synonym rules into conditional functional dependencies (Q989485) (← links)
- Scalar aggregation in inconsistent databases. (Q1401279) (← links)
- How does incoherence affect inconsistency-tolerant semantics for Datalog\(^\pm\)? (Q1653442) (← links)
- A graded approach to database repair by context-aware distance semantics (Q1677932) (← links)
- Magic sets for disjunctive Datalog programs (Q1761296) (← links)
- Matching dependencies: semantics and query answering (Q1762196) (← links)
- Minimal-change integrity maintenance using tuple deletions (Q1776402) (← links)
- Active integrity constraints for general-purpose knowledge bases (Q1783734) (← links)
- A comparison of fuzzy and annotated logic programming (Q1827314) (← links)
- Consistent query answering for primary keys in Datalog (Q2035471) (← links)
- Query answering DL-lite knowledge bases from hidden datasets (Q2035633) (← links)
- On the complexity and approximability of repair position selection problem (Q2051902) (← links)
- General information spaces: measuring inconsistency, rationality postulates, and complexity (Q2075379) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies (Q2248518) (← links)
- A dissimilarity-based framework for generating inconsistency-tolerant logics (Q2254632) (← links)
- Distance-based paraconsistent logics (Q2270429) (← links)
- Possibilistic nested logic programs and strong equivalence (Q2344722) (← links)
- Policy-based inconsistency management in relational databases (Q2353971) (← links)
- Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results (Q2385448) (← links)
- Deductive databases for computing certain and consistent answers from mediated data integration systems (Q2386182) (← links)
- Analysing inconsistent first-order knowledgebases (Q2389648) (← 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)
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family (Q2462646) (← links)
- A paraconsistent logic programming approach for querying inconsistent databases (Q2463646) (← links)
- Computational methods for database repair by signed formulae (Q2502158) (← links)
- Document Spanners (Q2796400) (← links)