Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders

DOI10.1007/978-3-540-88425-5_9zbMath1185.68692OpenAlexW1591778176MaRDI QIDQ3541047

Ryszard Janicki

Publication date: 25 November 2008

Published in: Rough Sets and Current Trends in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88425-5_9

Mathematics Subject Classification ID

Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Other classical set theory (including functions, relations, and set algebra) (03E20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval graphs and interval orders
• A scaling method for priorities in hierarchical structures
• A weak order approach to group ranking

This page was built for publication: Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders