How Dirty Is Your Relational Database? An Axiomatic Approach

DOI10.1007/978-3-540-75256-1_12zbMath1148.68353OpenAlexW1480892787MaRDI QIDQ3524922

V. S. Subrahmanian, Maria Vanina Martinez, Andrea Pugliese, Gerardo I. Simari, Henri Prade

Publication date: 16 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75256-1_12

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (13)

Merging existential rules programs in multi-agent contexts through credibility accrual ⋮ On an MCS-based inconsistency measure ⋮ On Measuring Inconsistency Using Maximal Consistent Sets ⋮ Measure-Based Inconsistency-Tolerant Maintenance of Database Integrity ⋮ Analysing inconsistent first-order knowledgebases ⋮ Quantifying conflicts in propositional logic through prime implicates ⋮ A three-valued semantics for querying and repairing inconsistent databases ⋮ On measuring inconsistency in definite and indefinite databases with denial constraints ⋮ Measuring Inconsistency Through Subformula Forgetting ⋮ Measuring inconsistency in some branching time logics ⋮ On the measure of conflicts: an argumentation-based framework ⋮ Belief base contraction by belief accrual ⋮ General information spaces: measuring inconsistency, rationality postulates, and complexity

Cites Work

• Unnamed Item
• Unnamed Item
• A logic for default reasoning
• Classifications for inconsistent theories
• Resolving contradictions: A plausible semantics for inconsistent systems
• A reasoning model based on the production of acceptable arguments
• On the theory of inconsistent formal systems
• Inconsistency Tolerance

This page was built for publication: How Dirty Is Your Relational Database? An Axiomatic Approach