Modeling Ceteris Paribus Preferences in Formal Concept Analysis
From MaRDI portal
Publication:4924394
DOI10.1007/978-3-642-38317-5_12zbMath1397.68175OpenAlexW226764615WikidataQ62046321 ScholiaQ62046321MaRDI QIDQ4924394
Publication date: 31 May 2013
Published in: Formal Concept Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38317-5_12
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
This page was built for publication: Modeling Ceteris Paribus Preferences in Formal Concept Analysis