Collaborative planning with confidentiality

DOI10.1007/s10817-010-9190-1zbMath1229.90072OpenAlexW2022472002MaRDI QIDQ540688

Yong-Cai Geng, Sumit K. Garg

Publication date: 3 June 2011

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-010-9190-1

zbMATH Keywords

confidentialitycollaborative planningAI literaturepolicy compliance

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theory of organizations, manpower planning in operations research (90B70) Other applications of logic (03B80)

Related Items (6)

On the complexity of verification of time-sensitive distributed systems ⋮ A rewriting framework and logic for activities subject to regulations ⋮ Bounded memory Dolev-Yao adversaries in collaborative systems ⋮ A framework for linear authorization logics ⋮ Collaborative planning with confidentiality ⋮ Bounded memory protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Collaborative planning with confidentiality
• A deductive solution for plan generation
• Linear logic
• Relating state-based and process-based concurrency through linear logic (full-version)
• Planning for conjunctive goals
• Conditional rewriting logic as a unified model of concurrency
• Complexity of some problems in Petri nets
• Linear logic as a logic of computations
• The complexity of Horn fragments of linear logic
• Generating plans in linear logic. I: Actions as proofs
• Petri nets, Horn programs, linear logic and vector games
• Relationships between nondeterministic and deterministic tape complexities
• Preserving Secrecy Under Refinement
• An Algorithm for the General Petri Net Reachability Problem
• On the security of public key protocols
• The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
• Relating State-Based and Process-Based Concurrency through Linear Logic
• Model Checking on Trees with Path Equivalences

This page was built for publication: Collaborative planning with confidentiality