{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T10:19:23Z","timestamp":1774261163025,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2010,7,24]],"date-time":"2010-07-24T00:00:00Z","timestamp":1279929600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10817-010-9190-1","type":"journal-article","created":{"date-parts":[[2010,7,23]],"date-time":"2010-07-23T07:03:41Z","timestamp":1279868621000},"page":"389-421","source":"Crossref","is-referenced-by-count":16,"title":["Collaborative Planning with Confidentiality"],"prefix":"10.1007","volume":"46","author":[{"given":"Max","family":"Kanovich","sequence":"first","affiliation":[]},{"given":"Paul","family":"Rowe","sequence":"additional","affiliation":[]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,24]]},"reference":[{"key":"9190_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., \u010cern\u00fd, P., Chaudhuri, S.: Model checking on trees with path equivalences. In: TACAS 2007, pp. 664\u2013678. Springer (2007)","DOI":"10.1007\/978-3-540-71209-1_51"},{"key":"9190_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., \u010cern\u00fd, P., Zdancewic, S.: Preserving secrecy under refinement. In: ICALP \u201906: Proceedings (Part II) of the 33rd International Colloquium on Automata, Languages and Programming, pp. 107\u2013118. Springer (2006)","DOI":"10.1007\/11787006_10"},{"key":"9190_CR3","unstructured":"Ashley, P., Hada, S., Karjoth, G., Powers, C., Schunter, M.:Enterprise privacy authorization language (EPAL 1.2) (2003). http:\/\/www.zurich.ibm.com\/security\/enterprise-privacy\/epal\/Specification\/index.html"},{"key":"9190_CR4","doi-asserted-by":"crossref","unstructured":"Barh, A., Mitchell, J.C., Datta, A., Sundaram, S.: Privacy and utility in business processes. In: 20th IEEE Computer Security Foundations Symposium (CSF 20). Venice, Italy (2007)","DOI":"10.1109\/CSF.2007.26"},{"key":"9190_CR5","doi-asserted-by":"crossref","unstructured":"Barth, A., Datta, A., Mitchell, J.C., Nissenbaum, H.: Privacy and conextual integrity: framework and applications. In: 27th IEEE Symposium on Security and Privacy (2006)","DOI":"10.1109\/SP.2006.32"},{"issue":"2","key":"9190_CR6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF03037438","volume":"4","author":"W Bibel","year":"1986","unstructured":"Bibel, W.: A deductive solution for plan generation. New Gener. Comput. 4(2), 115\u2013132 (1986)","journal-title":"New Gener. Comput."},{"key":"9190_CR7","doi-asserted-by":"crossref","unstructured":"Cervesato, I., Durgin, N., Kanovich, M., Scedrov, A.: Interpreting strands in linear logic. In: Veith, H., Heintze, N., Clark, E. (eds.) 2000 Workshop on Formal Methods and Computer Security\u2014FMCS\u201900. Chicago, IL (2000)","DOI":"10.21236\/ADA465155"},{"key":"9190_CR8","doi-asserted-by":"crossref","unstructured":"Cervesato, I., Scedrov, A.: Relating state-based and process-based concurrency through linear logic. In: de\u00a0Queiroz, R. (ed.) Thirteenth Workshop on Logic, Language, Information and Computation\u2014WoLLIC\u201906, Stanford, CA, 18\u201321 July, pp. 145\u2013176. Elsevier ENTCS 165 (2006)","DOI":"10.1016\/j.entcs.2006.05.043"},{"issue":"10","key":"9190_CR9","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1016\/j.ic.2008.11.006","volume":"207","author":"I Cervesato","year":"2009","unstructured":"Cervesato, I., Scedrov, A.: Relating state-based and process-based concurrency through linear logic (full-version). Inf. Comput. 207(10), 1044\u20131077 (2009)","journal-title":"Inf. Comput."},{"issue":"3","key":"9190_CR10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0004-3702(87)90092-0","volume":"32","author":"D Chapman","year":"1987","unstructured":"Chapman, D.: Planning for conjunctive goals. Artif. Intell. 32(3), 333\u2013377 (1987)","journal-title":"Artif. Intell."},{"issue":"2","key":"9190_CR11","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public key protocols. IEEE Trans. Inf. Theory 29(2), 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9190_CR12","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3233\/JCS-2004-12203","volume":"12","author":"N Durgin","year":"2004","unstructured":"Durgin, N., Lincoln, P., Mitchell, J., Scedrov, A.: Multiset rewriting and the complexity of bounded security protocols. J. Comput. Secur. 12(2), 247\u2013311 (2004)","journal-title":"J. Comput. Secur."},{"key":"9190_CR13","doi-asserted-by":"crossref","unstructured":"Garg, D., Bauer, L., Bowers, K.D., Pfenning, F., Reiter, M.K.: A linear logic of authorization and knowledge. In: Proceedings of the 11th European Symposium on Research in Computer Science (ESORICS\u201906). Springer Lecture Notes in Computer Science, vol. 4189, pp. 297\u2013312. Springer-Verlag (2006)","DOI":"10.1007\/11863908_19"},{"key":"9190_CR14","doi-asserted-by":"crossref","unstructured":"Garg, D., Pfenning, F.: Non-interference in constructive authorization logic. In: Proc. of the IEEE Computer Security Foundations Workshop (CSFW), pp. 283\u2013296 (2006)","DOI":"10.1109\/CSFW.2006.18"},{"key":"9190_CR15","doi-asserted-by":"crossref","unstructured":"Gehlot, V., Gunter, C.: Normal process representatives. In: Proc. of the Fifth Annual IEEE Symposium on Logic in Computer Science, pp. 200\u2013207. Philadelphia, PA (1990)","DOI":"10.1109\/LICS.1990.113746"},{"issue":"1","key":"9190_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comp. Sci. 50(1), 1\u2013102 (1987)","journal-title":"Theor. Comp. Sci."},{"key":"9190_CR17","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: Linear logic: Its syntax and semantics. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Notes, vol. 222, pp. 1\u201342. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511629150.002"},{"key":"9190_CR18","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security models. In: IEEE Symposium on Security and Privacy, pp. 11\u201320 (1982)","DOI":"10.1109\/SP.1982.10014"},{"key":"9190_CR19","unstructured":"Greenstadt, R., Pierce, J.P., Tambe, M.: Analysis of privacy loss in distributed constraint optimization. In: 21st Conference on Artificial Intelligence (AAAI). Boston, MA (2006)"},{"key":"9190_CR20","unstructured":"Greenstadt, R., Smith, M.D.: Collaborative scheduling: threats and promises. In: Fifth Annual Workshop on Economics and Information Security. Cambridge, England (2006)"},{"key":"9190_CR21","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Longman Publishing Co., Inc., Boston, MA (2001)"},{"key":"9190_CR22","unstructured":"Ives, Z.G., Khandelwal, N., Kapur, A., Cakir, M.: ORCHESTRA: Rapid, collaborative sharing of dynamic data. In: Conference on Innovative Data Systems Research (CIDR), pp. 107\u2013118 (2005)"},{"issue":"3","key":"9190_CR23","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","volume":"4","author":"ND Jones","year":"1977","unstructured":"Jones, N.D., Landweber, L.H., Lien, Y.E.: Complexity of some problems in Petri nets. Theor. Comp. Sci. 4(3), 277\u2013299 (1977)","journal-title":"Theor. Comp. Sci."},{"key":"9190_CR24","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Rowe, P., Scedrov, A.: Collaborative planning with privacy. In: 20th IEEE Computer Security Foundations Symposium (CSF 20). Venice, Italy (2007)","DOI":"10.1109\/CSF.2007.12"},{"key":"9190_CR25","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Rowe, P., Scedrov, A.: Policy compliance in collaborative systems. In: 22nd IEEE Computer Security Foundations Symposium (CSF22), pp. 218\u2013233. Port Jefferson, NY (2009)","DOI":"10.1109\/CSF.2009.19"},{"issue":"6","key":"9190_CR26","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1017\/S0960129501003413","volume":"11","author":"M Kanovich","year":"2001","unstructured":"Kanovich, M., Vauzeilles, J.: The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity. Math. Struct. Comput. Sci. 11(6), 689\u2013716 (2001)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9190_CR27","doi-asserted-by":"crossref","unstructured":"Kanovich, M.I.: Horn programming in linear logic is NP-complete. In: Proc. 7-th Annual IEEE Syposium on Logic in Computer Science, Santa Cruz, pp. 200\u2013210 (1992)","DOI":"10.1109\/LICS.1992.185533"},{"key":"9190_CR28","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0168-0072(94)90085-X","volume":"69","author":"MI Kanovich","year":"1994","unstructured":"Kanovich, M.I.: The complexity of Horn fragments of linear logic. Ann. Pure Appl. Logic 69, 195\u2013241 (1994)","journal-title":"Ann. Pure Appl. Logic"},{"key":"9190_CR29","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0168-0072(94)90011-6","volume":"67","author":"MI Kanovich","year":"1994","unstructured":"Kanovich, M.I.: Linear logic as a logic of computations. Ann. Pure Appl. Logic 67, 183\u2013212 (1994)","journal-title":"Ann. Pure Appl. Logic"},{"key":"9190_CR30","doi-asserted-by":"crossref","unstructured":"Kanovich, M.I.: The direct simulation of Minsky machines in linear logic. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Notes, vol. 222, pp. 123\u2013145 (1995)","DOI":"10.1017\/CBO9780511629150.007"},{"issue":"1-2","key":"9190_CR31","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0168-0072(94)00060-G","volume":"75","author":"MI Kanovich","year":"1995","unstructured":"Kanovich, M.I.: Petri nets, Horn programs, linear logic and vector games. Ann. Pure Appl. Logic 75(1-2), 107\u2013135 (1995)","journal-title":"Ann. Pure Appl. Logic"},{"key":"9190_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M Li","year":"1997","unstructured":"Li, M., Vitanyi, P.: An introduction to Kolmogorov complexity and its applications. Springer, New York (1997)"},{"key":"9190_CR33","doi-asserted-by":"crossref","unstructured":"Lincoln, P.D., Shankar, N.: Proof search in first-order linear logic and other cut-free sequent calculi. In: Ninth Annual Symposium on Logic in Computer Science (Paris, France), pp. 282\u2013291. IEEE Computer Society Press (1994)","DOI":"10.1109\/LICS.1994.316061"},{"issue":"2","key":"9190_CR34","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0304-3975(93)90007-G","volume":"113","author":"M Masseron","year":"1993","unstructured":"Masseron, M., Tollu, C., Vauzeilles, J.: Generating plans in linear logic I: actions as proofs. Theor. Comp. Sci. 113(2), 349\u2013370 (1993)","journal-title":"Theor. Comp. Sci."},{"issue":"3","key":"9190_CR35","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"EW Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"key":"9190_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(95)00034-C","volume":"76","author":"D McDermott","year":"1995","unstructured":"McDermott, D., Hendler, J.: Planning: what it is, what it could be, An introduction to the special issue on planning and scheduling. Artif. Intell. 76, 1\u201316 (1995)","journal-title":"Artif. Intell."},{"key":"9190_CR37","unstructured":"McLean, J.: Security models. In: Marciniak, J. (ed.) Encyclopedia of Software Engineering. Wiley (1994)"},{"key":"9190_CR38","doi-asserted-by":"crossref","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. In: Selected Papers of the Second Workshop on Concurrency and Compositionality, pp. 73\u2013155. Elsevier Science Publishers Ltd. Essex (1992)","DOI":"10.1016\/0304-3975(92)90182-F"},{"issue":"2","key":"9190_CR39","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/JCS-2006-14203","volume":"14","author":"AC Myers","year":"2006","unstructured":"Myers, A.C., Sabelfeld, A., Zdancewic, S.: Enforcing robust declassification and qualified robustness. J. Comput. Secur. 14(2), 157\u2013196 (2006). Extended abstract in CSFW, pp. 172\u2013186 (2004)","journal-title":"J. Comput. Secur."},{"key":"9190_CR40","volume-title":"Principles of Artificial Intelligence","author":"NJ Nilsson","year":"1980","unstructured":"Nilsson, N.J.: Principles of Artificial Intelligence. Springer, Berlin (1980)"},{"key":"9190_CR41","volume-title":"Computational Complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley Publishing Company, Inc., Reading, MA (1994)"},{"issue":"2","key":"9190_CR42","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/293411.293455","volume":"42","author":"J Reagle","year":"1999","unstructured":"Reagle, J., Cranor, L.F.: The platform for privacy preferences. Commun. ACM 42(2), 48\u201355 (1999)","journal-title":"Commun. ACM"},{"key":"9190_CR43","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Syntactic control of interference. In: Symposium on Principles of Programming Languages (POPL), pp. 39\u201346 (1978)","DOI":"10.1145\/512760.512766"},{"key":"9190_CR44","unstructured":"Rowe, P.: Policy Compliance, Confidentiality and Complexity in Collaborative Systems. PhD thesis, University of Pennsylvania (2009)"},{"key":"9190_CR45","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J., Relationship between nondeterministic and deterministic tape classes. J. Comput. Syst. Sci. 4, 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"9190_CR46","series-title":"NATO Advanced Science Institutes, Series F","first-page":"281","volume-title":"Proof and Computation, Proceedings Marktoberdorf Summer School 1993","author":"A Scedrov","year":"1994","unstructured":"Scedrov, A.: Linear logic and computation: A survey. In: Schwichtenberg, H. (ed.) Proof and Computation, Proceedings Marktoberdorf Summer School 1993, pp. 281\u2013298. NATO Advanced Science Institutes, Series F, Springer-Verlag, Berlin (1994)"},{"key":"9190_CR47","doi-asserted-by":"crossref","unstructured":"Taylor, N.E., Ives, Z.G.: Reconciling while tolerating disagreement in collaborative data sharing. In: ACM SIGMOD Conference on Management of Data, pp. 13\u201324 (2006)","DOI":"10.1145\/1142473.1142476"},{"key":"9190_CR48","unstructured":"Wiederhold, G., Bilello, M., Sarathy, V., Qian, X.: Protecting collaboration. In: Proc. 19th NIST-NCSC National Information Systems Security Conference, pp. 561\u2013569 (1996)"},{"key":"9190_CR49","doi-asserted-by":"crossref","unstructured":"Zdancewic, S., Myers, A.C.: Robust declassification. In: Proc. 14th IEEE Computer Securtiy Foundations Workshop (CSFW), pp. 15\u201323 (2001)","DOI":"10.1109\/CSFW.2001.930133"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-010-9190-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10817-010-9190-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-010-9190-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T07:57:30Z","timestamp":1740297450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10817-010-9190-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,24]]},"references-count":49,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9190"],"URL":"https:\/\/doi.org\/10.1007\/s10817-010-9190-1","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,24]]}}}