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
Cites work
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 786485 (Why is no real title available?)
- scientific article; zbMATH DE number 786490 (Why is no real title available?)
- A deductive solution for plan generation
- An Algorithm for the General Petri Net Reachability Problem
- Collaborative planning with confidentiality
- Complexity of some problems in Petri nets
- Conditional rewriting logic as a unified model of concurrency
- Generating plans in linear logic. I: Actions as proofs
- Linear logic
- Linear logic as a logic of computations
- Model Checking on Trees with Path Equivalences
- On the security of public key protocols
- Petri nets, Horn programs, linear logic and vector games
- Planning for conjunctive goals
- Preserving Secrecy Under Refinement
- Relating state-based and process-based concurrency through linear logic
- Relating state-based and process-based concurrency through linear logic (full-version)
- Relationships between nondeterministic and deterministic tape complexities
- The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
- The complexity of Horn fragments of linear logic
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
- Bounded memory protocols
- scientific article; zbMATH DE number 1975138 (Why is no real title available?)
- 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)
