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 条
  • [31] Stochastic algorithms for exact and approximate feasibility of robust LMIs
    Calafiore, G
    Polyak, BT
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2001, 46 (11) : 1755 - 1759
  • [32] Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
    Haeupler, Bernhard
    Mohapatra, Jeet
    Su, Hsin-Hao
    PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2018, : 179 - 188
  • [33] THE TRAVELING SALESMAN PROBLEM - AN OVERVIEW OF EXACT AND APPROXIMATE ALGORITHMS
    LAPORTE, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 59 (02) : 231 - 247
  • [34] Exact and Approximate Algorithms for the Filter Design Optimization Problem
    Aksoy, Levent
    Flores, Paulo
    Monteiro, Jose
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2015, 63 (01) : 142 - 154
  • [35] Algorithms for exact and approximate statistical simulation of Poisson ensembles
    T. A. Averina
    G. A. Mikhailov
    Computational Mathematics and Mathematical Physics, 2010, 50 : 951 - 962
  • [36] Exact and Approximate Algorithms for the Most Connected Vertex Problem
    Sheng, Cheng
    Tao, Yufei
    Li, Jianzhong
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2012, 37 (02):
  • [37] Combinations of local search and exact algorithms
    Dumitrescu, I
    Stützle, T
    APPLICATIONS OF EVOLUTIONARY COMPUTING, 2003, 2611 : 211 - 223
  • [38] Exact and approximate computation of B-spline curves on surfaces
    Renner, G
    Weiss, V
    COMPUTER-AIDED DESIGN, 2004, 36 (04) : 351 - 362
  • [39] On Fast and Exact Computation of Error Metrics in Approximate LSB Adders
    Roy, Avishek Sinha
    Biswas, Rajdeep
    Dhar, Anindya Sundar
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2020, 28 (04) : 876 - 889
  • [40] New algorithms for the exact computation of the sign of algebraic expressions
    Gavrilova, M
    Gavrilov, D
    Rokne, J
    1996 CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING - CONFERENCE PROCEEDINGS, VOLS I AND II: THEME - GLIMPSE INTO THE 21ST CENTURY, 1996, : 314 - 317