{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:55:07Z","timestamp":1794336907145,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540305538","type":"print"},{"value":"9783540316503","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11591191_44","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T04:44:25Z","timestamp":1132634665000},"page":"637-650","source":"Crossref","is-referenced-by-count":3,"title":["The Relationship Between Reasoning About Privacy and Default Logics"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Dix","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolfgang","family":"Faber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V. S.","family":"Subrahmanian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/69.599933","volume":"9","author":"M. Cadoli","year":"1997","unstructured":"Cadoli, M., Eiter, T., Gottlob, G.: Default Logic as a Query Language. IEEE Transactions on Knowledge and Data Engineering\u00a09, 448\u2013463 (1997)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"44_CR2","first-page":"289","volume-title":"Proc.\u00a0of 10th European Conf.\u00a0on Artificial Intelligence ECAI 1992","author":"J. Dix","year":"1992","unstructured":"Dix, J.: Default Theories of Poole-Type and a Method for Constructing Cumulative Versions of Default Logic. In: Neumann, B. (ed.) Proc.\u00a0of 10th European Conf.\u00a0on Artificial Intelligence ECAI 1992, pp. 289\u2013293. John Wiley & Sons, Chichester (1992)"},{"key":"44_CR3","volume-title":"Nonmonotonic Logics; Context-Dependent Reasoning","author":"W. Marek","year":"1993","unstructured":"Marek, W., Truszczy\u0144ski, M.: Nonmonotonic Logics; Context-Dependent Reasoning, 1st edn. Springer, Berlin (1993)","edition":"1"},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A Logic for Default Reasoning. Artificial Intelligence\u00a013, 81\u2013132 (1980)","journal-title":"Artificial Intelligence"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0004-3702(91)90011-8","volume":"49","author":"H. Kautz","year":"1991","unstructured":"Kautz, H., Selman, B.: Hard Problems for Simple Default Logics. Artificial Intelligence\u00a049, 243\u2013279 (1991)","journal-title":"Artificial Intelligence"},{"key":"44_CR6","unstructured":"Stillman, J.: It\u2019s Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logic. In: Proceedings AAAI 1990, pp. 571\u2013579 (1990)"},{"key":"44_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","volume":"2","author":"G. Gottlob","year":"1992","unstructured":"Gottlob, G.: Complexity Results for Nonmonotonic Logics. Journal of Logic and Computation\u00a02, 397\u2013425 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"44_CR8","unstructured":"Stillman, J.: The Complexity of Propositional Default Logic. In: Proceedings AAAI 1992, pp. 794\u2013799 (1992)"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0168-0072(98)00057-8","volume":"97","author":"G. Gottlob","year":"1999","unstructured":"Gottlob, G., Leone, N., Veith, H.: Succinctness as a Source of Expression Complexity. Annals of Pure and Applied Logic\u00a097, 231\u2013260 (1999)","journal-title":"Annals of Pure and Applied Logic"},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00881799","volume":"10","author":"C. Baral","year":"1993","unstructured":"Baral, C., Subrahmanian, V.: Dualities Between Alternative Semantics for Logic Programming and Non-Monotonic Reasoning. Journal of Automated Reasoning\u00a010, 399\u2013420 (1993)","journal-title":"Journal of Automated Reasoning"},{"key":"44_CR11","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1145\/195664.195675","volume":"19","author":"M. Winslett","year":"1994","unstructured":"Winslett, M., Smith, K., Qian, X.: Formal Query Languages for Secure Relational Databases. ACM Transactions on Database Systems\u00a019, 626\u2013662 (1994)","journal-title":"ACM Transactions on Database Systems"},{"key":"44_CR12","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/69.390247","volume":"7","author":"P. Bonatti","year":"1995","unstructured":"Bonatti, P., kRAVS, S., Subrahmanian, V.: Foundations of Secure Deductive Databases. IEEE Transactions on Knowledge and Data Engineering\u00a07, 406\u2013422 (1995)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"44_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/3-540-63614-5_56","volume-title":"Foundations of Intelligent Systems","author":"F. Cuppens","year":"1997","unstructured":"Cuppens, F., Demolombe, R.: A Modal Logical Framework for Security Policies. In: Ra\u015b, Z.W., Skowron, A. (eds.) ISMIS 1997. LNCS, vol.\u00a01325, pp. 579\u2013589. Springer, Heidelberg (1997)"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Samarati, P., Sweeney, L.: Generalizing Data to Provide Anonymity when Disclosing Information. In: Proceedings ACM Symp. on Principles of Database Systems (1998)","DOI":"10.1145\/275487.275508"},{"key":"44_CR15","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1145\/1007568.1007631","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 2004)","author":"S. Rizvi","year":"2004","unstructured":"Rizvi, S., Mendelzon, A.O., Sudarshan, S., Roy, P.: Extending query rewriting techniques for fine-grained access control. In: Weikum, G., K\u00f6nig, A.C., De\u00dfloch, S. (eds.) Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 2004), pp. 551\u2013562. ACM, New York (2004)"},{"key":"44_CR16","first-page":"108","volume-title":"Proceedings of the Thirtieth International Conference on Very Large Data Bases (VLDB 2004)","author":"K. LeFevre","year":"2004","unstructured":"LeFevre, K., Agrawal, R., Ercegovac, V., Ramakrishnan, R., Xu, Y., DeWitt, D.J.: Limiting disclosure in hippocratic databases. In: Nascimento, M.A., \u00d6zsu, 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), pp. 108\u2013119. Morgan Kaufmann, San Francisco (2004)"},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. \u00a09, 365\u2013385 (1991)","DOI":"10.1007\/BF03037169"},{"key":"44_CR18","unstructured":"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"},{"key":"44_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artificial Intelligence\u00a0138, 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"44_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-24609-1_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y. Lierler","year":"2003","unstructured":"Lierler, Y., Maratea, M.: Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 346\u2013350. Springer, Heidelberg (2003)"},{"key":"44_CR21","unstructured":"Lin, F., Zhao, Y.: ASSAT: 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)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11591191_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:02:31Z","timestamp":1605625351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11591191_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540305538","9783540316503"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11591191_44","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11591191","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}