Answer sets for consistent query answering in inconsistent databases
From MaRDI portal
Publication:4815028
DOI10.1017/S1471068403001832zbMath1079.68026OpenAlexW2178708778MaRDI QIDQ4815028
Marcelo Arenas, Leopoldo Bertossi, Jan Chomicki
Publication date: 19 August 2004
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068403001832
Related Items
On the data complexity of consistent query answering, Advances in WASP, Consistent query answering via ASP from different perspectives: Theory and practice, Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results, Deductive databases for computing certain and consistent answers from mediated data integration systems, Analysing inconsistent first-order knowledgebases, How does incoherence affect inconsistency-tolerant semantics for Datalog\(^\pm\)?, Cautious reasoning in ASP via minimal models and unsatisfiable cores, Data cleaning and query answering with matching dependencies and matching functions, Dynamic Consistency Checking in Goal-Directed Answer Set Programming, Anytime Computation of Cautious Consequences in Answer Set Programming, From causes for database queries to repairs and model-based diagnosis and back, On repairing and querying inconsistent probabilistic spatio-temporal databases, First-order query rewriting for inconsistent databases, A graded approach to database repair by context-aware distance semantics, Belief revision within fragments of propositional logic, Extending inclusion dependencies with conditions, Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering?, Bounded repairability of word languages, Independent Update Reflections on Interdependent Database Views, The Semantics of Consistency and Trust in Peer Data Exchange Systems, Taming primary key violations to query large inconsistent data via ASP, Consistency and trust in peer data exchange systems, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Abstract Solvers for Computing Cautious Consequences of ASP programs, Better Paracoherent Answer Sets with Less Resources, A Logic Framework for P2P Deductive Databases, Scalar aggregation in inconsistent databases., On the Complexity of Finding Set Repairs for Data-Graphs, A three-valued semantics for querying and repairing inconsistent databases, Reasoning with Uncertainty by Nmatrix–Metric Semantics, Score-based explanations in data management and machine learning: an answer-set programming approach to counterfactual analysis, Repairing XML functional dependency violations, Inconsistency-Tolerant Querying of Description Logic Knowledge Bases, Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results, Prioritized repairing and consistent query answering in relational databases, Probabilistic query answering over inconsistent databases, Finding explanations of inconsistency in multi-context systems, Assertional Removed Sets Merging of DL-Lite Knowledge Bases, Distance semantics for database repair, Tractable reasoning and efficient query answering in description logics: The DL-Lite family, A paraconsistent logic programming approach for querying inconsistent databases, World-set decompositions: Expressiveness and efficient algorithms, Paracoherent answer set computation, Repairing inconsistent answer set programs using rules of thumb: a gene regulatory networks case study, Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies, Reasoning with prioritized information by iterative aggregation of distance functions, On the finite controllability of conjunctive query answering in databases under open-world assumption, A dissimilarity-based framework for generating inconsistency-tolerant logics, Magic sets for disjunctive Datalog programs, Matching dependencies: semantics and query answering, A framework for reasoning under uncertainty based on non-deterministic distance semantics, Simplified forms of computerized reasoning with distance semantics, A sound and complete model-generation procedure for consistent and confidentiality-preserving databases, Distance-based paraconsistent logics, Minimal-change integrity maintenance using tuple deletions, Disjunctive databases for representing repairs, Computational methods for database repair by signed formulae, Incorporating cardinality constraints and synonym rules into conditional functional dependencies, Active integrity constraints for general-purpose knowledge bases, Document Spanners, Inconsistency-Tolerant Integrity Checking for Knowledge Assimilation, Consistent query answering for primary keys in Datalog, Query answering DL-lite knowledge bases from hidden datasets, Omission-Based Abstraction for Answer Set Programs, On the complexity and approximability of repair position selection problem, Answers that Have Integrity, Context-Aware Distance Semantics for Inconsistent Database Systems, A dichotomy in the complexity of consistent query answering for queries with two atoms, Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis, Inconsistency Management in Reactive Multi-context Systems, A comparison of fuzzy and annotated logic programming, General information spaces: measuring inconsistency, rationality postulates, and complexity, Approximation Schemes in Logic and Artificial Intelligence, Possibilistic nested logic programs and strong equivalence, $$\exists $$ -ASP for Computing Repairs with Existential Ontologies, Policy-based inconsistency management in relational databases
