On measuring inconsistency in graph databases with regular path constraints
From MaRDI portal
Cites work
- A distance-based framework for inconsistency-tolerant reasoning and inconsistency measurement in DL-Lite
- A syntax-based approach to measuring the degree of inconsistency for belief bases
- Classifications for inconsistent theories
- Classifying Inconsistency Measures Using Graphs
- Computable queries for relational data bases
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- Dimensional inconsistency measures and postulates in spatio-temporal databases
- Distance-based measures of inconsistency
- General information spaces: measuring inconsistency, rationality postulates, and complexity
- Handling and measuring inconsistency in non-monotonic logics
- How Dirty Is Your Relational Database? An Axiomatic Approach
- scientific article; zbMATH DE number 3568040 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Inconsistency measurement based on variables in minimal unsatisfiable subsets
- Inconsistency measures for probabilistic logics
- Knowledge graphs
- Measuring and computing database inconsistency via repairs
- Measuring and repairing inconsistency in probabilistic knowledge bases
- Measuring database inconsistency
- Measuring inconsistency
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- Measuring inconsistency with constraints for propositional knowledge bases
- On measuring inconsistency in definite and indefinite databases with denial constraints
- On the Complexity of Finding Set Repairs for Data-Graphs
- On the complexity of inconsistency measurement
- On the data complexity of consistent query answering over graph databases
- On the evaluation of inconsistency measures
- On the expressivity of inconsistency measures
- On the measure of conflicts: Shapley inconsistency values
- Policy-based inconsistency management in relational databases
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
- PP is closed under intersection
- Quantifying conflicts in propositional logic through prime implicates
- Regular path queries with constraints
- Relative inconsistency measures
- Repair-based degrees of database inconsistency
- Responsibility for inconsistency
- Revisiting postulates for inconsistency measures
- Rewriting of regular expressions and regular path queries
- Semantic inconsistency measures using 3-valued logics
- Stream-based inconsistency measurement
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- The complexity of combinatorial problems with succinct input representation
- The complexity of computing the permanent
- The Complexity of Enumeration and Reliability Problems
- The complexity of facets (and some facets of complexity)
- The value of a player in n-person games
Cited in
(2)
This page was built for publication: On measuring inconsistency in graph databases with regular path constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028687)
