The relationship between reasoning about privacy and default logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3835 LNAI, Issue , 2005, Pages 637-650

  Dix, Jürgen ^a   Faber, Wolfgang ^b   Subrahmanian, V S ^c  

^a CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF CALABRIA   (Italy)

^c Institute of Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CREDIT CARD; DEFAULT LOGICS; LOGIC THEORIES; REASONING;

COMPUTATIONAL COMPLEXITY; DATA PRIVACY; FORMAL LOGIC; INFORMATION RETRIEVAL; INTERNET; LOGIC PROGRAMMING; MATHEMATICAL MODELS;

INFORMATION ANALYSIS;

EID: 33745452090     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_44     Document Type: Conference Paper

References (21)

1. Cadoli, M., Eiter, T., Gottlob, G.: Default Logic as a Query Language. IEEE Transactions on Knowledge and Data Engineering 9 (1997) 448-463
2. Dix, J.: Default Theories of Poole-Type and a Method for Constructing Cumulative Versions of Default Logic. In Neumann, B., ed.: Proc. of 10th European Conf. on Artificial Intelligence ECAI 92, John Wiley & Sons (1992) 289-293
3. Marek, W., Truszczyriski, M.: Nonmonotonic Logics; Context-Dependent Reasoning. 1st edn. Springer, Berlin (1993)
4. Reiter, R.: A Logic for Default Reasoning. Artificial Intelligence 13 (1980) 81-132
5. Kautz, H., Selman, B.: Hard Problems for Simple Default Logics. Artificial Intelligence 49 (1991) 243-279
6. Stillman, J.: It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logic. In: Proceedings AAAI-90. (1990) 571-579
7. Gottlob, G.: Complexity Results for Nonmonotonic Logics. Journal of Logic and Computation 2 (1992) 397-425
8. Stillman, J.: The Complexity of Propositional Default Logic. In: Proceedings AAAI-92. (1992) 794-799
9. Gottlob, G., Leone, N., Veith, H.: Succinctness as a Source of Expression Complexity. Annals of Pure and Applied Logic 97 (1999) 231-260
10. Baral, C., Subrahmanian, V.: Dualities Between Alternative Semantics for Logic Programming and Non-Monotonie Reasoning. Journal of Automated Reasoning 10 (1993) 399-420
11. M. Winslett, K.S., Qian, X.: Formal Query Languages for Secure Relational Databases. ACM Transactions on Database Systems 19 (1994) 626-662
12. P. Bonatti, S.K., Subrahmanian, V.: Foundations of Secure Deductive Databases. IEEE Transactions on Knowledge and Data Engineering 7 (1995) 406-422
13. Cuppens, F., Demolombe, R.: A Modal Logical Framework for Security Policies. In: Proc. ISMIS. (1997) 579-589
14. Samarati, P., Sweeney, L.: Generalizing Data to Provide Anonymity when Disclosing Information. In: Proceedings ACM Symp. on Principles of Database Systems. (1998)
15. Rizvi, S., Mendelzon, A.O., Sudarshan, S., Roy, P.: Extending query rewriting techniques for fine-grained access control. In Weikum, G., König, A.C., Deßloch, S., eds.: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 2004), ACM (2004) 551-562
16. LeFevre, K., Agrawal, R., Ercegovac, V., Ramakrishnan, R., Xu, Y., DeWitt, D.J.: Limiting disclosure in hippocratic databases. In Nascimento, M.A., Özsu, M.T., Kossmann, D., Miller, R.J., Blakeley, J.A., Schiefer, K.B., eds.: Proceedings of the Thirtieth International Conference on Very Large Data Bases (VLDB 2004), Morgan Kaufmann (2004) 108-119
17. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. 9 (1991) 365-385
18. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. (2005) To appear. Available via http://www.arxiv.org/ps/cs.AI/0211004.
19. Simons, P., Niemelä, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138 (2002) 181-234
20. Lierler, Y., Maratea, M.: Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. In Lifschitz, V., Niemelä, I., eds.: Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-7). LNCS, Springer (2004) 346-350
21. Lin, F., Zhao, Y.: ASS AT: Computing Answer Sets of a Logic Program by SAT Solvers. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002), Edmonton, Alberta, Canada, AAAI Press / MIT Press (2002)