Skip to main content

Compiling Solution Configurations in Semiring Valuation Systems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4827))

Abstract

This paper describes a new method for solving optimization queries in semiring valuation systems. In contrast to existing techniques which focus essentially on the identification of solution configurations, we propose foremost the construction of an implicit representation of the solution configuration set in the shape of a Boolean function. This intermediate compilation step allows then to efficiently execute many further relevant queries that go far beyond the traditional task of enumerating solution configurations.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shenoy, P.P., Shafer, G.: Axioms for probability and belief-function proagation. In: Shachter, R.D., Levitt, T.S., Kanal, L.N., Lemmer, J.F. (eds.) Uncertainty in Artificial Intelligence 4. Machine intelligence and pattern recognition  9, 169–198 (1990)

    Google Scholar 

  2. Shafer, G.: An axiomatic study of computation in hypertrees. Working Paper 232, School of Business, University of Kansas (1991)

    Google Scholar 

  3. Kohlas, J.: Information Algebras: Generic Structures for Inference. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  4. Shenoy, P.: Axioms for dynamic programming. In: Gammerman, A. (ed.) Computational Learning and Probabilistic Reasoning, pp. 259–275. Wiley, Chichester (1996)

    Google Scholar 

  5. Bertele, U., Brioschi, F.: Nonserial Dynamic Programming. Academic Press, London (1972)

    MATH  Google Scholar 

  6. Wilson, N.: Decision diagrams for the computation of semiring valuations. In: IJCAI 2005. 19th International Joint Conference on Artificial Intelligence, pp. 331–336 (2005)

    Google Scholar 

  7. Mateescu, R., Dechter, R.: Compiling constraint networks into and/or multi-valued decision diagrams (aomdds). In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 329–343. Springer, Heidelberg (2006)

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  9. Wachter, M., Haenni, R.: Propositional DAGs: a new graph-based language for representing Boolean functions. In: KR 2006. 10th International Conference on Principles of Knowledge Representation and Reasoning, pp. 277–285 (2006)

    Google Scholar 

  10. Shenoy, P.: Valuation-based systems: A framework for managing uncertainty in expert systems. In: Fuzzy Logic for the Management of Uncertainty, pp. 83–104 (1992)

    Google Scholar 

  11. Schneuwly, C., Pouly, M., Kohlas, J.: Local computation in covering join trees. Technical Report 04-16, University of Fribourg (2004)

    Google Scholar 

  12. Schweizer, B., Sklar, A.: Statistical metric spaces. Pacific J. Math. 10, 313–334 (1960)

    MATH  MathSciNet  Google Scholar 

  13. Pouly, M., Kohlas, J.: Local computation & dynamic programming. Technical Report 07-02, University of Fribourg (2007)

    Google Scholar 

  14. Kohlas, J., Wilson, N.: Exact and approximate local computation in semiring induced valuation algebras. Technical Report 06-06, University of Fribourg (2006)

    Google Scholar 

  15. Bistarelli, S., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G., Fargier, H.: Semiring-based CSPs and valued CSPs: Frameworks, properties, comparison. Constraints 4, 199–240 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  16. Zadeh, L.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems 1 (1978)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Alexander Gelbukh Ángel Fernando Kuri Morales

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pouly, M., Haenni, R., Wachter, M. (2007). Compiling Solution Configurations in Semiring Valuation Systems . In: Gelbukh, A., Kuri Morales, Á.F. (eds) MICAI 2007: Advances in Artificial Intelligence. MICAI 2007. Lecture Notes in Computer Science(), vol 4827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76631-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76631-5_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76630-8

  • Online ISBN: 978-3-540-76631-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics