Collaborative planning with confidentiality
DOI10.1007/S10817-010-9190-1zbMATH Open1229.90072OpenAlexW2022472002MaRDI QIDQ540688FDOQ540688
Authors: Yong-Cai Geng, Sumit K. Garg Error creating thumbnail:
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
Recommendations
- Multi-agent confidential abductive reasoning
- Logic of secrets in collaboration networks
- Secure distributed constraint satisfaction: reaching agreement without revealing private information
- Efficient and secure information sharing in distributed, collaborative environments
- Planning for multiagent using ASP-Prolog
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)
Cites Work
- Planning for conjunctive goals
- Title not available (Why is that?)
- Relationships between nondeterministic and deterministic tape complexities
- Title not available (Why is that?)
- Linear logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conditional rewriting logic as a unified model of concurrency
- An Algorithm for the General Petri Net Reachability Problem
- Preserving Secrecy Under Refinement
- Complexity of some problems in Petri nets
- Linear logic as a logic of computations
- On the security of public key protocols
- The complexity of Horn fragments of linear logic
- The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
- Collaborative planning with confidentiality
- Relating state-based and process-based concurrency through linear logic (full-version)
- Relating state-based and process-based concurrency through linear logic
- Generating plans in linear logic. I: Actions as proofs
- Petri nets, Horn programs, linear logic and vector games
- Title not available (Why is that?)
- Model Checking on Trees with Path Equivalences
- A deductive solution for plan generation
Cited In (12)
- A rewriting framework and logic for activities subject to regulations
- Efficient and secure information sharing in distributed, collaborative environments
- Secure and conditional resource coordination for successful collaborations
- Title not available (Why is that?)
- Bounded memory protocols
- Bounded memory Dolev-Yao adversaries in collaborative systems
- Collaborative planning with confidentiality
- Secure collaborative supply chain planning and inverse optimization -- the JELS model
- Representing and planning with interacting actions and privacy
- A framework for linear authorization logics
- Decentralised scheduling with confidentiality protection
- On the complexity of verification of time-sensitive distributed systems
This page was built for publication: Collaborative planning with confidentiality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540688)
