Selected Results and Related Issues of Confidentiality-Preserving Controlled Interaction Execution

Biskup, Joachim

doi:10.1007/978-3-319-30024-5_12

Cited by 6 publications

(1 citation statement)

References 59 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among others, this makes GPL a natural choice for the formal study of access control mechanisms that need to maintain the confidentiality of some pieces of knowledge. For example, [78] discusses a number of settings where an information system needs to be able to determine whether answering a given query would allow the user to derive information that is supposed to remain secret, based on possibly incomplete knowledge of what that user already knows. The use of GPL is also natural in game theoretic settings, where agents need to reason based on their incomplete knowledge about the goals of other agents, e.g., as part of a negotiation process [79].…”

Section: Discussionmentioning

confidence: 99%

Generalized possibilistic logic: Foundations and applications to qualitative reasoning about uncertainty

Dubois

Prade

Schockaert

2017

Artificial Intelligence

View full text Add to dashboard Cite

This paper introduces generalized possibilistic logic (GPL), a logic for epistemic reasoning based on possibility theory. Formulas in GPL correspond to propositional combinations of assertions such as "it is certain to degree λ that the propositional formula α is true". As its name suggests, the logic generalizes possibilistic logic (PL), which at the syntactic level only allows conjunctions of the aforementioned type of assertions. At the semantic level, PL can only encode sets of epistemic states encompassed by a single least informed one, whereas GPL can encode any set of epistemic states. This feature makes GPL particularly suitable for reasoning about what an agent knows about the beliefs of another agent, e.g., allowing the former to draw conclusions about what the other agent does not know. We introduce an axiomatization for GPL and show its soundness and completeness w.r.t. possibilistic semantics. Subsequently, we highlight the usefulness of GPL as a powerful unifying framework for various knowledge representation formalisms. Among others, we show how comparative uncertainty and ignorance can be modelled in GPL. We also exhibit a close connection between GPL and various existing formalisms, including possibilistic logic with partially ordered formulas, a logic of conditional assertions in the style of Kraus, Lehmann and Magidor, answer set programming and a fragment of the logic of minimal belief and negation as failure. Finally, we analyse the computational complexity of reasoning in GPL, identifying decision problems at the first, second, third and fourth level of the polynomial hierarchy.

show abstract

Section: Discussionmentioning

confidence: 99%