Skip to main content
SpringerLink
Log in
Book cover

Quantitative Logic and Soft Computing 2016 pp 203–212Cite as

Splitting Algorithm of Valuation Algebra and Its Application in Automaton Representation of Semiring Valued Constraint Problems

  • Conference paper
  • First Online:

  • 573 Accesses

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

Abstract

A splitting algorithm is developed for solving single-query projection problems in valuation algebras. This method is based on a generalized combination theorem. It is shown that by using this new kind of combination property, a given single-query projection problem can be broken into pieces of subprojection problems which might be solved simultaneously by different computational resources. At last, as an application of splitting algorithms, we develop an optimized procedure for automaton representation of semiring valued constraint problems.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Biso, A., Rossi, F., Sperduti, A.: Experimental results on Learning Soft Constraints. In: Proceedings of the 7th International Conference on Principles of Knowledge Representation and Reasoning (KR 2000)

    Google Scholar 

  2. Bistarelli, S.: Semirings for soft constraint solving and programming. Lecture Notes in Computer Science, vol. 2962. Springer, Heidelberg (2004)

    Google Scholar 

  3. Bistarelli, S., Montanari, U., Rossi, F.: Constraint solving over semirings. In: Proceedings of IJCAI 1995, Morgan Kaufman, San Francisco (1995)

    Google Scholar 

  4. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint solving and optimization. J. ACM 44, 201–236 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint logic programming: syntax and semantics. ACM Trans. Program. Lang. Syst. (TOPLAS) 23, 1–29 (2001)

    Google Scholar 

  6. Bistarelli, S., Codognet, P., Rossi, F.: Abstracting soft constraints: framework, properties, examples. Artif. Intell. 139, 175–211 (2002)

    Article  MathSciNet  Google Scholar 

  7. Cooper, M.C., Schiex, T.: Arc consistency for soft constraints: reduction opertions in fuzzy or valued constraint satisfaction. Artif. Intell. 154, 199–227 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dechter, R.: Bucket elimination: a unifying framework for reasoning. Artif. Intell. 113, 41–85 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Dechter, R., Kask, K., Larrosa, J.: A general scheme for multiple lower bound computation in constraint optimization. In: Proceedings of CP2001, 346–360 (2001)

    Google Scholar 

  10. Dechter, R., Rish, I.: Mini-buckets: a general scheme for bounded inference. J. ACM 50, 107–153 (2003)

    Google Scholar 

  11. Fargier, H., Lang, J., Schiex, T.: Selecting prefered solutions in fuzzy constraint satisfaction problems. In: Proceedings of the 1st European Congress on Fuzzy and Intelligent Technologies (EUFIT) (1993)

    Google Scholar 

  12. Haenni, R.: Ordered valuation algebras: A generic framework for approximation inference. Internat. J. Approx. Reason. 37, 1–41 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Jensen, F.V., Lauritzen, S.L., Olesen, K.G.: Bayesian updating in causal probabilistic networks by local computation. Comput. Stat. Quart. 4, 269–282 (1990)

    MathSciNet  MATH  Google Scholar 

  14. Kask, K., Dechter, R.: Branch and bound with mini-bucket heuristics. In: Proceedings of the International Joint Conference on Artificial Intelligence(IJCAI99), 426–433 (1999)

    Google Scholar 

  15. Kohlas, J.: Information algebras: Generic structures for inference. Springer, Heidelberg (2003)

    Book  MATH  Google Scholar 

  16. Kohlas, J., Shenoy, P.P.: Computation in valuation algebras. In: Gabbay, D.M., Smets, P. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems. Algorithms for Uncertainty and Defeasible Reasoning, vol. 5, pp. 5–39. Kluwer Academic Publishers, Dordrecht (2000)

    Chapter  Google Scholar 

  17. Kohlas, J., Wilson, N.: Semiring induced valuation algebras: exact and approximate local computation algorithms. Artif. Intell. 172, 1360–1398 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kolda, T.G.: Partitioning sparse rectangular matrices for parallel processing, in: Solving Irregularly Structured Problems in Parallel, Irregualr’98, number 1457 in Lecture Notes in Computer Science. Springer, Berlin, 68–79 (1998)

    Google Scholar 

  19. Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their apllication to expert systems. J. Royal Statis. Soc. B 50, 157–224 (1988)

    MathSciNet  MATH  Google Scholar 

  20. Leenen, L., Meyer, T., Ghose, A.K.: Relaxations of semiring constraint satisfaction problems. In: Beek, P.V. (ed.) CP 2005 . LNCS, vol. 3709, Springer, Heidelberg (2005)

    Google Scholar 

  21. Li, Y. M.: The representation of semiring-based constraint satisfaction problems using fuzzy finite automata. In: Proceedings of the Quantitative Logic and Soft Computing-the QlSC’2012, Springer, Xi’an (2012)

    Google Scholar 

  22. Montanari, U.: Networks of constraints: fundamental properties and applications to Picture Processing, Information Science, 95–132 (1974)

    Google Scholar 

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

    Google Scholar 

  24. Pouly, M., Haenni, R., Wachter, M.: Compiling solution configurations in semiring valuation systems. In: Gelbukh, A., Kuri Morales, A.F., (eds.). MICAI 2007, LNAI 4827, pp. 248–259 (2007)

    Google Scholar 

  25. Rossi, F., Sperduti, A.: Learning solution preferences in constraint problems, Journal of Theoretical and Experimental Artificial Intelligence (JETAI)10 (1998)

    Google Scholar 

  26. Rossi, F., Sperduti, A.: Acquiring both constraint and solution preferences in interactive constraint systems. Constraints 9, (2004)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  30. Shenoy, P.: Valuation-based systems: a framework for managing uncertainty in expert systems. In L.A. Zadeh, Kacprzyk (eds), Fuzzy Logic for the Management of Uncertainty, 83–104 (1992)

    Google Scholar 

  31. Wachter, M., Haenni, R., Pouly, M.: Optimizing inference in Bayesian netwoks and semiring valuation algebras. In: Gelbukh, A., Kuri Morales, A.F. (eds.), MICAI 2007, LNAI 4827, 236–247 (2007)

    Google Scholar 

Download references

Acknowledgments

This work is supported by the National Natural Science Foundation of China (Grant No. 61403290, 61261047) and the horizontal subject (Grant No. HX0112071615) of Xidian University. And this work is also funded by the Fundamental Research Funds for the Central Universities (JB150704).

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Xidian University, Xi’an, 710071, China

    Bang-He Han

  2. College of Mathematics and Information Science, Shaanxi Normal University, Xi’an, 710119, China

    Yong-Ming Li

  3. School of Telecommunications Engineering, Xidian University, Xi’an, 710071, China

    Qiong-Na Chen

Authors
  1. Bang-He Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yong-Ming Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qiong-Na Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bang-He Han .

Editor information

Editors and Affiliations

  1. Zhejiang, Zhejiang Sci-Tech University Zhejiang, Hangzhou, China

    Tai-He Fan

  2. Fujian, Jimei University Fujian, Xiamen, China

    Shui-Li Chen

  3. Zhejiang, Zhejiang Sci-Tech University Zhejiang, Hangzhou, China

    San-Min Wang

  4. Yanta, Shaanxi Normal University Yanta, Xi’an, China

    Yong-Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this paper

Cite this paper

Han, BH., Li, YM., Chen, QN. (2017). Splitting Algorithm of Valuation Algebra and Its Application in Automaton Representation of Semiring Valued Constraint Problems. In: Fan, TH., Chen, SL., Wang, SM., Li, YM. (eds) Quantitative Logic and Soft Computing 2016. Advances in Intelligent Systems and Computing, vol 510. Springer, Cham. https://doi.org/10.1007/978-3-319-46206-6_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46206-6_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46205-9

  • Online ISBN: 978-3-319-46206-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation