The relationship between reasoning about privacy and default logics

Jürgen Dix*, Wolfgang Faber, V. S. Subrahmanian

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

5 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)637-650
Number of pages14
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3835 LNAI
StatePublished - 2005
Externally publishedYes
Event12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2005 - Montego Bay, Jamaica
Duration: Dec 2 2005Dec 6 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'The relationship between reasoning about privacy and default logics'. Together they form a unique fingerprint.

Cite this