Topic
Semiring
About: Semiring is a research topic. Over the lifetime, 1685 publications have been published within this topic receiving 19849 citations. The topic is also known as: rig.
Papers published on a yearly basis
Papers
More filters
•
14 Mar 2014
TL;DR: In this paper, the authors define Hemirings and semirings as "sets and relations with values with values in a semiring" and define a set of conditions on semimodal construction.
Abstract: Preface. 1. Hemirings and semirings: definitions and examples. 2. Sets and relations with values in a semiring. 3. Building new semirings from old. 4. Some conditions on semirings. 5. Complemented elements in semirings. 6. Ideals in semirings. 7. Prime and semiprime ideals in semirings. 8. Factor semirings. 9. Morphisms of semirings. 10. Kernels of morphisms. 11. Semirings of fractions. 12. Euclidean semirings. 13. Additively-regular semirings. 14. Semimodules over semirings. 15. Factor semimodules. 16. Some constructions for semimodules. 17. Free, projective, and injective semimodules. 18. Localization of semimodules. 19. Linear algebra over a semiring. 20. Partially-ordered semirings. 21. Lattice-ordered semirings. 22. Complete semirings. 23. Complete semimodules. 24. CLO-semirings. 25. Fixed points of affine maps. References. Index of applications. Index of terminology.
977 citations
••
[...]
TL;DR: This paper initiates the study of soft semirings by using the soft set theory, and the notions of soft Semirings, soft subsemirings,soft ideals, idealistic softSemirings and soft semiring homomorphisms are introduced, and several related properties are investigated.
Abstract: Molodtsov introduced the concept of soft sets, which can be seen as a new mathematical tool for dealing with uncertainty. In this paper, we initiate the study of soft semirings by using the soft set theory. The notions of soft semirings, soft subsemirings, soft ideals, idealistic soft semirings and soft semiring homomorphisms are introduced, and several related properties are investigated.
579 citations
••
TL;DR: This paper describes and compares two frameworks for constraint solving where classical CSPs, fuzzy C SPs, weighted CSP’s, partial constraint satisfaction, and others can be easily cast.
Abstract: In this paper we describe and compare two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. While comparing the two approaches, we show how to pass from one to the other one, and we discuss when this is possible. The two frameworks have been independently introduced in ijcai95,jacm and schiex-ijcai95.
310 citations
•
TL;DR: A generic algorithm for finding single-source shortest distances in a weighted directed graph when the weights satisfy the conditions of the general semiring framework is given.
Abstract: We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances in a weighted directed graph when the weights satisfy the conditions of our general semiring framework. The same algorithm can be used to solve efficiently classical shortest paths problems or to find the k-shortest distances in a directed graph. It can be used to solve single-source shortest-distance problems in weighted directed acyclic graphs over any semiring. We examine several semirings and describe some specific instances of our generic algorithms to illustrate their use and compare them with existing methods and algorithms. The proof of the soundness of all algorithms is given in detail, including their pseudocode and a full analysis of their running time complexity.
307 citations
••
TL;DR: In this article, a nonlinear projection on subsemimodules is introduced, where the projection of a point is the maximal approximation from below of the point in the sub-semimmodule.
273 citations