Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-14T15:58:14.075Z Has data issue: false hasContentIssue false
  • English
  • Français

On conditions for semirings to induce compact information algebras

Published online by Cambridge University Press:  15 May 2015

XUECHONG GUAN ,
YONGMING LI  and
JUERG KOHLAS
XUECHONG GUAN
Affiliation:
School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou, Jiangsu 221116, China Email: guanxc@foxmail.com
YONGMING LI
Affiliation:
College of Computer Science, Shaanxi Normal University, Xi'an, Shaanxi 710062, China
JUERG KOHLAS
Affiliation:
Department of Informatics, University of Fribourg, Fribourg, Switzerland
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, we study the relationship between ordering structures on semirings and semiring-induced valuation algebras. We show that a semiring-induced valuation algebra is a complete (resp. continuous) lattice if and only if the semiring is complete (resp. continuous) lattice with respect to the reverse order relation on semirings. Furthermore, a semiring-induced information algebra is compact, if the dual of the semiring is an algebraic lattice.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 27 , Special Issue 4: Symposium on Domain Theory (ISDT 2013) , May 2017 , pp. 460 - 469
Copyright
Copyright © Cambridge University Press 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bistarelli, S., Codognet, P. and Rossi, F. (2002). Abstracting soft constraints: Framework, properties, examples. Artificial Intelligence 139 (2) 175–211.Google Scholar
Davey, B.A. and Priestley, H.A. (2002). Introduction to Lattices and Order, 2nd edition, Cambridge University Press.Google Scholar
Gierz, G. et al. (2003). Continuous Lattices and Domains: Encyclopedia of Mathematics and its Applications, Cambridge University Press.Google Scholar
Guan, X.C. and Li, Y.M. (2012). On two types of continuous information algebras. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 20 (4) 655–671.Google Scholar
Haenni, R. (2004). Ordered valuation algebras: a generic framework for approximating inference. International Journal of Approximate Reasoning 37 (1) 1–41.CrossRefGoogle Scholar
Kohlas, J. (2003). Information Algebras: Generic Structures for Inference, Springer-Verlag.Google Scholar
Kohlas, J. (2010). Lecture Notes: The Algebraic Theory of Information. Available at URL: http://diuf.unifr.ch/drupal/tns/sites/diuf.unifr.ch.drupal.tns/files/file/kohlas/main.pdf.Google Scholar
Kohlas, J. and Wilson, N. (2008). Semiring induced valuation algebras: Exact and approximate local computation algorithms. Artifical Intelligence 172 (11) 1360–1399.Google Scholar
Li, S.J. and Ying, M. (2008). Soft constraint abstraction based on semiring homomorphism. Theoretical Computer Science 403 (2–3) 192–201.Google Scholar
Pouly, M. (2008). A Generic Framework for Local Computation, Ph.D. Thesis, University of Fribourg, Switzerland.Google Scholar
Shafer, G. An Axiomatic Study of Computation in Hypertrees, Working Paper No. 232, School of Business, University of Kansas.Google Scholar
Shenoy, P.P. (1989). A valuation-based language for expert systems. International Journal of Approximate Reasoning 3 (5) 383–411.CrossRefGoogle Scholar