Modèle flou d'expression des préférences basé sur les CP-Nets

03/31/2013
by   Hanene Rezgui, et al.
0

This article addresses the problem of expressing preferences in flexible queries while basing on a combination of the fuzzy logic theory and Conditional Preference Networks or CP-Nets.

READ FULL TEXT

page 1

page 2

research
03/23/2020

Modeling Contrary-to-Duty with CP-nets

In a ceteris-paribus semantics for deontic logic, a state of affairs whe...
research
12/22/2017

Rank Pruning for Dominance Queries in CP-Nets

Conditional preference networks (CP-nets) are a graphical representation...
research
01/11/2018

Interactive Learning of Acyclic Conditional Preference Networks

Learning of user preferences, as represented by, for example, Conditiona...
research
06/26/2018

Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting

Combinatorial preference aggregation has many applications in AI. Given ...
research
09/21/2021

Perpetual Free-choice Petri nets are lucent – proof of a theorem of van der Aalst using CP-exhaustions

Van der Aalst's theorem is an important result for the analysis and synt...
research
12/01/2014

Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas

Canonical (logic) programs (CP) refer to normal logic programs augmented...
research
09/21/2021

Enriching a CP-Net by Asymmetric Merging

Conditional ceteris paribus preference networks (CP-nets) are commonly u...

Please sign up or login with your details

Forgot password? Click here to reset