Approximations of arbitrary relations by partial orders
DOI10.1016/j.ijar.2018.04.012zbMath1448.68418OpenAlexW2802689086WikidataQ129901668 ScholiaQ129901668MaRDI QIDQ1644912
Publication date: 22 June 2018
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2018.04.012
Combinatorics of partially ordered sets (06A07) Theory of fuzzy sets, etc. (03E72) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other classical set theory (including functions, relations, and set algebra) (03E20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal approximations with rough sets and similarities in measure spaces
- A fast and effective heuristic for the feedback arc set problem
- Interval graphs and interval orders
- Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
- Approximations for the maximum acyclic subgraph problem
- On optimal approximations of arbitrary relations by partial orders
- On approximation of relations by generalized closures and generalized kernels
- Two views of the theory of rough sets in finite universes
- A weak order approach to group ranking
- Approximations of Arbitrary Binary Relations by Partial Orders: Classical and Rough Set Models
- Pairwise Comparisons Based Non-Numerical Ranking
- On a certain distance of sets and the corresponding distance of functions
- A fixed-parameter algorithm for the directed feedback vertex set problem
- On a pairwise comparison-based consistent non-numerical ranking
- Reducibility among Combinatorial Problems
- Property-Driven Rough Sets Approximations of Relations
This page was built for publication: Approximations of arbitrary relations by partial orders
