The relationship between reasoning about privacy and default logics

Authors:
Jürgen Dix;Wolfgang Faber;V. S. Subrahmanian
Affiliations:
Institut für Informatik, TU Clausthal, Clausthal, Germany;Department of Mathematics, University of Calabria, Rende (CS), Italy;Department of Computer Science, University of Maryland, College Park, MD
Venue:
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2005

Citing 14
Cited 2

Hard problems for simple default logics

Artificial Intelligence - Special issue on knowledge representation
Default theories of Poole-type and a method for constructing cumulative versions of default logic

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Formal query languages for secure relational databases

ACM Transactions on Database Systems (TODS)
Generalizing data to provide anonymity when disclosing information (abstract)

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Nonmonotonic Logic: Context-Dependent Reasoning

Nonmonotonic Logic: Context-Dependent Reasoning
Extending and implementing the stable model semantics

Artificial Intelligence
Foundations of Secure Deductive Databases

IEEE Transactions on Knowledge and Data Engineering
Default Logic as a Query Language

IEEE Transactions on Knowledge and Data Engineering
A Modal Logical Framework for Security Policies

ISMIS '97 Proceedings of the 10th International Symposium on Foundations of Intelligent Systems
ASSAT: computing answer sets of a logic program by SAT solvers

Eighteenth national conference on Artificial intelligence
Extending query rewriting techniques for fine-grained access control

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Limiting disclosure in hippocratic databases

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
It's not my default: the complexity of membership problems in restricted propositional default logics

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
The complexity of propositional default logics

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence

A formal model of data privacy

PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Privacy preservation using multi-context systems and default logic

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

There is now an incredible wealth of data about individuals, businesses and organisations. This data is freely available over the Internet to almost anyone willing to pay for it, independently of whether they are identity thieves or credit card scam artists or legitimate users. This has led to a growing need for privacy. In this paper, we first present a simple logical model of privacy. We then show that the problem of privacy may be reduced to that of brave reasoning in default logic theories, thus reducing this important problem to a well understood reasoning paradigm. By leveraging this reduction, we are able to develop an efficient privacy preservation algorithm and a set of complexity results for privacy preservation. Efficient systems based on answer set programming are available to implement our algorithm.