Fayçal Touazi

Learn More
OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. Abstract. CP-nets (Conditional preference networks) are a well-known compact graphical representation of preferences in Artificial Intelligence, that can be viewed as a qualitative counterpart to Bayesian nets. In case(More)
This paper advocates possibilistic logic with partially ordered priority weights as a powerful representation format for handling preferences. An important benefit of such a logical setting is the ability to check the consistency of the specified preferences. We recall how Qualitative Choice Logic statements (and related ones), as well as CP-nets(More)
This paper studies the extension of possibilistic logic to the case when weights attached to formulas are symbolic and stand for variables that lie in a totally ordered scale, and only partial knowledge is available on the relative strength of these weights. A proof of the soundness and the completeness of this logic according to the relative certainty(More)
This note corrects a claim made in the above-mentioned paper about the exact representation of a conditional preference network by means of a possibilistic logic base with partially ordered symbolic weights. We provide a counterexample that shows that the possibilistic logic representation is indeed not always exact. This is the basis of a short discussion(More)
OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. Abstract. The paper presents a new approach to deal with database preference queries, where preferences are represented in the style of possibilistic logic, using symbolic weights. The symbolic weights may be processed(More)
This note corrects a claim made in the above-mentioned paper about the exact representation of a conditional preference network by means of a possibilistic logic base with partially ordered symbolic weights. We provide a counter-example that shows that the possibilistic logic representation is indeed not always exact. This is the basis of a short discussion(More)
  • 1