Inference control of open relational queries under closed-world semantics based on theorem proving
作者：
Highlights：
•
• Inference control of open queries depends on closed-world completeness.
• Control procedures require costly calls to a theorem prover.
• A single prover call can be optimized by rewriting the completeness input.
• The number of prover calls can be reduced by optimized control procedures.
• Control of open queries can be employed for privacy-preserving data publishing.
摘要
Highlights •Inference control of open queries depends on closed-world completeness.•Control procedures require costly calls to a theorem prover.•A single prover call can be optimized by rewriting the completeness input.•The number of prover calls can be reduced by optimized control procedures.•Control of open queries can be employed for privacy-preserving data publishing.
论文关键词：Active domain,Combined lying and refusal,Confidentiality policy,Completeness sentence,Data publishing,Diagonalization function,Inference control,Lying,Open query,Theorem proving
论文评审过程：Received 9 February 2016, Revised 15 June 2016, Accepted 22 July 2016, Available online 5 August 2016, Version of Record 19 September 2017.
论文官网地址：https://doi.org/10.1016/j.is.2016.07.008
