Collaborative planning with confidentiality
type: Item
instance of: scholarly article
title: Collaborative planning with confidentiality
zbMATH Open document ID: 1229.90072
author: Yong-Cai Geng
author: Sumit K. Garg
published in: Journal of Automated Reasoning
publication date: 2011-06-03T00:00:00Z
review text: This article proposes a formal model for collaboration which includes concerns of confidentiality between the agents. The authors begin with an introductory section presenting the existing literature and relevant elements from the area of artificial intelligence (AI). The second section proceeds to describe action systems which are formal AI ways to describe the environment and the actions that are permitted to the agents to achieve a desired goal. The third section moves to consider planning, which is modeled as an element of a state-transition system. This is followed by a presentation of a formal approach to data confidentiality policies and the ways they can be represented in the model. The logical structure of the proposed collaborative planning with confidentiality concerns model is presented in the fifth section, where several of its properties are studied. The sixth section investigates the complexity and completeness of the proposed model and the paper concludes with a section on suggested future work and a list of relevant references.
reviewed by: Efstratios Rappos
Mathematics Subject Classification ID: 90B70
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 03B80
zbMATH DE Number: 5903836
zbMATH Keywords: collaborative planning
zbMATH Keywords: confidentiality
zbMATH Keywords: AI literature
zbMATH Keywords: policy compliance
MaRDI profile type: Publication
full work available at URL: s10817-010-9190-1
OpenAlex ID: W2022472002
cites work: Model Checking on Trees with Path Equivalences
cites work: Preserving Secrecy Under Refinement
cites work: A deductive solution for plan generation
cites work: Relating State-Based and Process-Based Concurrency through Linear Logic
cites work: Relating state-based and process-based concurrency through linear logic (full-version)
cites work: Planning for conjunctive goals
cites work: On the security of public key protocols
cites work: Linear logic
cites work: Q4842966
cites work: Q4506483
cites work: Complexity of some problems in Petri nets
cites work: The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
cites work: The complexity of Horn fragments of linear logic
cites work: Linear logic as a logic of computations
cites work: Q4842971
cites work: Petri nets, Horn programs, linear logic and vector games
cites work: Generating plans in linear logic. I: Actions as proofs
cites work: An Algorithm for the General Petri Net Reachability Problem
cites work: Conditional rewriting logic as a unified model of concurrency
cites work: Q3856120
cites work: Q4298260
cites work: Relationships between nondeterministic and deterministic tape complexities
DOI: 10.1007/S10817-010-9190-1
description: scientific article; zbMATH DE number 5903836