Exploiting stability for compact representation of independency models

L.C. van der Gaag, S. Lopatatzidis

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    The notion of stability in semi-graphoid independency models was introduced to describe the dynamics of (probabilistic) independency upon inference. We revisit the notion in view of establishing compact representations of semi-graphoid models in general. Algorithms for this purpose typically build upon dedicated operators for constructing new independency statements from a starting set of statements. In this paper, we formulate a generalised strong-contraction operator to supplement existing operators, and prove its soundness. We then embed the operator in a state-of-the-art algorithm and illustrate that the thus enhanced algorithm may establish more compact model representations.
    Original languageEnglish
    Title of host publicationSymbolic and Quantitative Approaches to Reasoning with Uncertainty
    Subtitle of host publication14th European Conference, ECSQARU 2017, Lugano, Switzerland, July 10–14, 2017, Proceedings
    EditorsA. Antonucci, L. Cholvy, O. Papini
    Place of PublicationBerlin
    PublisherSpringer
    Pages104-114
    DOIs
    Publication statusPublished - 2017

    Publication series

    NameLecture Notes in Computer Science
    Volume10369

    Fingerprint

    Dive into the research topics of 'Exploiting stability for compact representation of independency models'. Together they form a unique fingerprint.

    Cite this