A sound and complete model-generation procedure for consistent and confidentiality-preserving databases

DOI10.1016/j.tcs.2011.04.026zbMath1223.68036OpenAlexW1982335840MaRDI QIDQ549726

Lena Wiese, Joachim Biskup

Publication date: 18 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.026

zbMATH Keywords

algorithmconfidentialityconstraintsavailabilitycontrolled query evaluationlogic database

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

Approximate keys and functional dependencies in incomplete databases with limited domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data exchange: semantics and query answering
• Secure data management in decentralized systems
• A formal analysis of information disclosure in data exchange
• On the expressive power of database queries with intermediate types
• Domain independence and the relational calculus
• Controlled query evaluation for known policies by combining lying and refusal
• Propositional belief base update and minimal change
• Controlled query evaluation with open queries for a decidable relational submodel
• The model evolution calculus as a first-order DPLL method
• Cover story management
• Encyclopedia of Database Systems
• Combining Consistency and Confidentiality Requirements in First-Order Databases
• Data Privacy for $\mathcal{ALC}$ Knowledge Bases
• Answer sets for consistent query answering in inconsistent databases
• Automated Deduction – CADE-20
• Inconsistency Tolerance
• A Machine-Oriented Logic Based on the Resolution Principle
• An authorization model and its formal semantics
• The classical decision problem.

This page was built for publication: A sound and complete model-generation procedure for consistent and confidentiality-preserving databases