Confidentiality-Preserving Data Publishing for Credulous Users by Extended Abduction

08/30/2011
by   Katsumi Inoue, et al.
0

Publishing private data on external servers incurs the problem of how to avoid unwanted disclosure of confidential data. We study a problem of confidentiality in extended disjunctive logic programs and show how it can be solved by extended abduction. In particular, we analyze how credulous non-monotonic reasoning affects confidentiality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/09/2022

Avoiding Pragmatic Oddity: A Bottom-up Defeasible Deontic Logic

This paper presents an extension of Defeasible Deontic Logic to deal wit...
research
08/03/2020

A lemma on closures and its application to modularity in logic programming semantics

This note points out a lemma on closures of monotonic increasing functio...
research
03/05/2002

Two results for proiritized logic programming

Prioritized default reasoning has illustrated its rich expressiveness an...
research
04/25/2014

On the Non-Monotonic Description Logic ALC+T_min

In the last 20 years many proposals have been made to incorporate non-mo...
research
05/03/2023

Continual Reasoning: Non-Monotonic Reasoning in Neurosymbolic AI using Continual Learning

Despite the extensive investment and impressive recent progress at reaso...
research
08/02/2018

Induction of Non-Monotonic Logic Programs to Explain Boosted Tree Models Using LIME

We present a heuristic based algorithm to induce non-monotonic logic pro...
research
09/18/2019

Induction of Non-monotonic Logic Programs To Explain Statistical Learning Models

We present a fast and scalable algorithm to induce non-monotonic logic p...

Please sign up or login with your details

Forgot password? Click here to reset