#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2012

2015

- This year (0)
- Last 5 years (8)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Didier Dubois, Henri Prade, Fayçal Touazi
- ECSQARU
- 2013

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 of binary attributes it captures specific partial orderings over Boolean interpretations where strict preference statements are defined between… (More)

- Didier Dubois, Henri Prade, Fayçal Touazi
- SGAI Conf.
- 2013

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)

- Claudette Cayrol, Didier Dubois, Fayçal Touazi
- FoIKS
- 2014

This paper presents first results toward the extension of possibilistic logic when the total order on formulas is replaced by a partial preorder. Few works have dealt with this matter in the past but they include some by Halpern, and Benferhat et al. Here we focus on semantic aspects, namely the construction of a partial order on interpretations from a… (More)

- Fayçal Touazi, Claudette Cayrol, Didier Dubois
- J. Applied Logic
- 2015

This paper presents the extension of results on reasoning with totally ordered belief bases to the partially ordered case. The idea is to reason from logical bases equipped with a partial order expressing relative certainty and to construct a partially ordered deductive closure. The difficult point lies in the fact that equivalent definitions in the totally… (More)

- Claudette Cayrol, Didier Dubois, Fayçal Touazi
- ECSQARU
- 2015

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)

- Didier Dubois, Henri Prade, Fayçal Touazi
- FQAS
- 2013

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 without the need of a numerical assignment of priority. Still, it is possible to introduce a partial ordering among the symbolic weights if necessary.… (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
- ›