Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics

DOI10.1016/j.tcs.2016.01.035zbMath1356.68226OpenAlexW2257249165WikidataQ62046314 ScholiaQ62046314MaRDI QIDQ507531

Sergei Obiedkov

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.035

zbMATH Keywords

formal concept analysisHorn formulasimplicationsceteris paribus preferences

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Uses Software

• CP-nets

Cites Work

• Computational techniques for a simple theory of conditional preferences
• Some decision and counting problems of the Duquenne-Guigues basis of implications
• Everything else being equal: a modal logic for ceteris paribus preferences
• Horn approximations of empirical data
• The logic of preference reconsidered
• Modeling Preferences over Attribute Sets in Formal Concept Analysis
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Modeling Ceteris Paribus Preferences in Formal Concept Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics