<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05948070</id>
  <dt>a</dt>
  <an>05948070</an>
  <augroup>
    <au>Miner More, Sara</au>
    <au>Naumov, Pavel</au>
  </augroup>
  <ti>The functional dependence relation on hypergraphs of secrets.</ti>
  <so>Leite, Jo\~ao (ed.) et al., Computational logic in multi-agent systems. 12th international workshop, CLIMA XII, Barcelona, Spain, July 17--18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22358-7/pbk). Lecture Notes in Computer Science 6814. Lecture Notes in Artificial Intelligence, 29-40 (2011).</so>
  <py>2011</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-22359-4_3</li>
  </ligroup>
  <abgroup>
    <ab>Summary: The paper considers interdependencies between secrets in a multiparty system. Each secret is assumed to be known only to a certain fixed set of parties. These sets can be viewed as edges of a hypergraph whose vertices are the parties of the system. In previous work, the authors investigated properties of interdependencies that are expressible through a multi-argument relation called independence, which is a generalization of a binary relation also known as nondeducibility. This work studies properties expressible through functional dependence. The main result is a complete and decidable logical system that describes interdependencies on a fixed hypergraph.</ab>
    <rv></rv>
  </abgroup>
</item>