REVIEW
Enriching a CP-Net by Asymmetric Merging
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Conditional ceteris paribus preference networks (CP-nets) are commonly used to capture qualitative conditional preferences. In many use cases, when the preferential structure of an agent is incomplete, information from other preferential structures (e.g. that of other users) preferences can be used to fill in the gaps. Earlier works proposed methods to symmetrically merge multiple incomplete CP-nets by means of voting semantics. However, the merged CP-net can contain preference relations that do not fit to a given user's original preference profile. This paper proposes an asymmetric merging (or enriching) method to obtain and fill-in preference relations of a user's CP-net from another CP-net in a way that preserves the original preference relations.
Discussion (0). Continue with ORCID to comment.