DocumentCode
3399726
Title
A possibilistic logic handling of strong preferences
Author
Benferhat, Salem ; Kaci, Souhila
Author_Institution
IRIT, CNRS, Toulouse, France
Volume
2
fYear
2001
fDate
25-28 July 2001
Firstpage
962
Abstract
This paper presents a possibilistic logic encoding of strong preferences of the form "in the context p, q is always preferred to ~q". We first present a semantics algorithm which allows one to rank-order different possible solutions with respect to a set of strong preferences. Then we provide its syntactic counterpart, where we show that any set of strong preferences can be transformed into a possibilistic knowledge base. This provides practical and efficient machinery to deal with strong preferences
Keywords
fuzzy logic; knowledge based systems; possibility theory; probabilistic logic; encoding; possibilistic knowledge base; possibilistic logic; semantics algorithm; solution rank ordering; strong preferences; Connectors; Decision making; Electronic mail; Encoding; Heart; Logic; Machinery; Ocean temperature; Possibility theory; Temperature distribution;
fLanguage
English
Publisher
ieee
Conference_Titel
IFSA World Congress and 20th NAFIPS International Conference, 2001. Joint 9th
Conference_Location
Vancouver, BC
Print_ISBN
0-7803-7078-3
Type
conf
DOI
10.1109/NAFIPS.2001.944735
Filename
944735
Link To Document