Semiring induced valuation algebras: Exact and approximate local computation algorithms

被引:36
|
作者
Kohlas, J. [2 ]
Wilson, N. [1 ]
机构
[1] Cork Constraint Computat Ctr, Dept Comp Sci, Cork, Ireland
[2] Univ Fribourg, Dept Informat, CH-1700 Fribourg, Switzerland
基金
爱尔兰科学基金会;
关键词
semirings; local computation; join tree decompositions; soft constraints; uncertainty; valuation networks; valuation algebras;
D O I
10.1016/j.artint.2008.03.003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this algebraic structure ranging from probability theory to numerical analysis, relational databases and various classical and non-classical logics. It turns out that many interesting models of valuation algebras may be derived from semiring valued mappings. In this paper we study how valuation algebras are induced by semirings and how the structure of the valuation algebra is related to the algebraic structure of the semiring. In particular, c-semirings with idempotent multiplication induce idempotent valuation algebras and therefore permit particularly efficient architectures for local computation. Also important are semirings whose multiplicative semigroup is embedded in a union of groups. They induce valuation algebras with a partially defined division. For these valuation algebras, the well-known architectures for Bayesian networks apply. We also extend the general computational framework to allow derivation of bounds and approximations, for when exact computation is not feasible. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:1360 / 1399
页数:40
相关论文
共 50 条
  • [1] On conditions for mappings to preserve optimal solutions of semiring-induced valuation algebras
    Guan, Xuechong
    Li, Yongming
    THEORETICAL COMPUTER SCIENCE, 2015, 563 : 86 - 98
  • [2] Optimizing inference in Bayesian networks and semiring valuation algebras
    Wachter, Michael
    Haenni, Rolf
    Pouly, Marc
    MICAI 2007: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2007, 4827 : 236 - +
  • [3] Exact and approximate algorithms for the longest induced path problem
    Marzo, Ruslan G.
    Ribeiro, Celso C.
    RAIRO-OPERATIONS RESEARCH, 2021, 55 (02) : 333 - 353
  • [4] A survey on multi-constrained optimal path computation Exact and approximate algorithms
    Garroppo, Rosario G.
    Giordano, Stefano
    Tavanti, Luca
    COMPUTER NETWORKS, 2010, 54 (17) : 3081 - 3107
  • [5] Exact and approximate rhythm matching algorithms
    Joseph Wun-Tat Chan
    Costas S. Iliopoulos
    Spiros Michalakopoulos
    M. Sohel Rahman
    International Journal on Digital Libraries, 2012, 12 (2-3) : 149 - 158
  • [6] Exact and approximate rhythm matching algorithms
    Chan, Joseph Wun-Tat
    Iliopoulos, Costas S.
    Michalakopoulos, Spiros
    Rahman, M. Sohel
    INTERNATIONAL JOURNAL ON DIGITAL LIBRARIES, 2012, 12 (2-3) : 149 - 158
  • [7] Local Computation Algorithms
    Rubinfeld, Ronitt
    PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19), 2019, : 3 - 3
  • [8] Exact and Approximate Tasks Computation in IoT Networks
    Cui, Yuhan
    Chin, Kwan-Wu
    Soh, Sieteng
    Ros, Montserrat
    IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (05): : 7974 - 7988
  • [9] Exact and approximate computation of the scatter halfspace depth
    Liu, Xiaohui
    Liu, Yuzi
    Laketa, Petra
    Nagy, Stanislav
    Chen, Yuting
    COMPUTATIONAL STATISTICS, 2025, 40 (01) : 547 - 572
  • [10] Divergence Measures and Approximate Algorithms for Valuation Based Systems
    Moral, Serafin
    INFORMATION PROCESSING AND MANAGEMENT OF UNCERTAINTY IN KNOWLEDGE-BASED SYSTEMS: APPLICATIONS, IPMU 2018, PT III, 2018, 855 : 591 - 602