Pith. sign in

REVIEW

Confidentiality-Preserving Data Publishing for Credulous Users by Extended Abduction

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1108.5825 v1 pith:BRQTVBCQ submitted 2011-08-30 cs.AI

Confidentiality-Preserving Data Publishing for Credulous Users by Extended Abduction

Katsumi Inoue , Chiaki Sakama , Lena Wiese This is my paper
classification cs.AI
keywords dataextendedabductionconfidentialitycredulousproblempublishingaffects
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.