Switch to: References

Add citations

You must login to add citations.
  1. Quantitative possibility theory: logical- and graphical-based representations.Hadja Faiza Khellaf-Haned & Salem Benferhat - 2014 - Journal of Applied Non-Classical Logics 24 (3):236-261.
    In the framework of quantitative possibility theory, two representation modes were developed: logical-based representation in terms of quantitative possibilistic bases and graphical-based representation in terms of product-based possibilistic networks. This paper deals with logical and graphical representations of uncertain information using a quantitative possibility theory framework. We first provide a deep analysis of the relationships between these two forms of representational frameworks. Then, in the logical setting, we develop syntactic relations between penalty logic and quantitative possibilistic logic. These translations are (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Topological parameters for time-space tradeoff.Rina Dechter & Yousri El Fattah - 2001 - Artificial Intelligence 125 (1-2):93-118.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Recursive conditioning.Adnan Darwiche - 2001 - Artificial Intelligence 126 (1-2):5-41.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Local conditioning in Bayesian networks.F. J. Díez - 1996 - Artificial Intelligence 87 (1-2):1-20.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A logical notion of conditional independence: properties and applications.Adnan Darwiche - 1997 - Artificial Intelligence 97 (1-2):45-82.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • PRM inference using Jaffray & Faÿ’s Local Conditioning.Christophe Gonzales & Pierre-Henri Wuillemin - 2011 - Theory and Decision 71 (1):33-62.
    Probabilistic Relational Models (PRMs) are a framework for compactly representing uncertainties (actually probabilities). They result from the combination of Bayesian Networks (BNs), Object-Oriented languages, and relational models. They are specifically designed for their efficient construction, maintenance and exploitation for very large scale problems, where BNs are known to perform poorly. Actually, in large-scale problems, it is often the case that BNs result from the combination of patterns (small BN fragments) repeated many times. PRMs exploit this feature by defining these patterns (...)
    Download  
     
    Export citation  
     
    Bookmark