Skip to main content
SpringerLink
Log in

Possibilistic Local Structure for Compiling Min-Based Networks

  • Conference paper
Synergies of Soft Computing and Statistics for Intelligent Data Analysis

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 190))

Abstract

Compiling graphical models has recently been triggered much research. First investigations were established in the probabilistic framework. This paper studies compilation-based inference in min-based possibilistic networks. We first take advantage of the idempotency property of the min operator to enhance an existing compilation-based inference method in the possibilistic framework. Then, we propose a new CNF encoding which fits well with the particular case of binary networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ayachi, R., Ben Amor, N., Benferhat, S., Haenni, R.: Compiling possibilistic networks: Alternative approaches to possibilistic inference. In: UAI, pp. 40–47 (2010)

    Google Scholar 

  2. Cadoli, M., Donini, F.: A survey on knowledge compilation. AI Commun. 10, 137–150 (1997)

    Google Scholar 

  3. Chavira, M., Darwiche, A.: Compiling bayesian networks with local structure. In: IJCAI, pp. 1306–1312 (2005)

    Google Scholar 

  4. Darwiche, A.: Decomposable negation normal form. J. ACM 48, 608–647 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Darwiche, A.: A logical approach to factoring belief networks. In: KR, pp. 409–420 (2002)

    Google Scholar 

  6. Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intel. Res. 17, 229–264 (2002)

    MathSciNet  MATH  Google Scholar 

  7. Dubois, D., Prade, H.: Possibility theory: An approach to computerized processing of uncertainty. Plenium Press, New York (1988)

    MATH  Google Scholar 

  8. Dubois, D., Prade, H.: Possibility theory. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and Systems Science, pp. 6927–6939. Springer (2009)

    Google Scholar 

  9. Fargier, H., Marquis, P.: On valued negation normal form formulas. In: IJCAI, pp. 360–365 (2007)

    Google Scholar 

  10. Hisdal, E.: Conditional possibilities independence and noninteraction. Fuzzy Set. Syst. 1, 283–297 (1978)

    Article  MATH  Google Scholar 

  11. Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmman, San Francisco (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LARODEC, Institut Supérieur de Gestion, University of Tunis, Le Bardo, 2000, Tunis, Tunisia

    Raouia Ayachi & Nahla Ben Amor

  2. CRIL-CNRS, Université d’Artois, 62307, Lens Cedex, France

    Salem Benferhat

Authors
  1. Raouia Ayachi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nahla Ben Amor
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Salem Benferhat
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raouia Ayachi .

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, Otto-von-Guericke University of Magdebur, Geb. 29, Raum 008, Universitätsplatz 2, Magdeburg, 39106, Germany

    Rudolf Kruse

  2. , FB Informatik & Informationswissenschaft, University of Konstanz, Konstanz, 78457, Germany

    Michael R. Berthold

  3. of Magdeburg, Faculty of Computer Science, Otto-von-Guericke University, Geb. 29, Universitätsplatz 2 008, Magdeburg, 39106, Germany

    Christian Moewes

  4. , Department of Statistics and OR, University of Oviedo, C/ Calvo Sotelo, s/n, Oviedo, 33007, Spain

    María Ángeles Gil

  5. Systems Research Institute, Polish Academy of Sciences, Newelska 6, Warsaw, 01-447, Poland

    Przemysław Grzegorzewski

  6. Systems Research Institute, Polish Academy of Sciences, Newelska 6, Warsaw, 01-447, Poland

    Olgierd Hryniewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ayachi, R., Amor, N.B., Benferhat, S. (2013). Possibilistic Local Structure for Compiling Min-Based Networks. In: Kruse, R., Berthold, M., Moewes, C., Gil, M., Grzegorzewski, P., Hryniewicz, O. (eds) Synergies of Soft Computing and Statistics for Intelligent Data Analysis. Advances in Intelligent Systems and Computing, vol 190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33042-1_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33042-1_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33041-4

  • Online ISBN: 978-3-642-33042-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation