Mastering the processing of preferences by using symbolic priorities in possibilistic logic

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 376-380

  Kaci, Souhila ^a   Prade, Henri ^b  

^a UNIV LILLE   (France)

^b UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

CETERIS PARIBUS; CLASSICAL LOGIC; COMPACT PROCESSING; CP-NETS; LOGIC FORMULAS; LOGIC-BASED APPROACH; NEW APPROACHES; PARTIAL ORDER; POSSIBILISTIC LOGIC; SYMBOLIC LEVEL;

COMPUTER CIRCUITS;

EID: 85028864999     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-376     Document Type: Conference Paper

References (18)

1. S. Benferhat, D. Dubois, S. Kaci, and H. Prade, ‘Bridging logical, comparative, and graphical possibilistic representation frameworks’, in ECSQARU, pp. 422–431, (2001).
2. S. Benferhat, D. Dubois, and H. Prade, ‘Representing default rules in possibilistic logic’, in KR, pp. 673–684, (1992).
3. S. Benferhat and H. Prade, ‘Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic’, in IJCAI, pp. 1281–1286, (2005).
4. S. Benferhat and S. Smaoui, ‘Hybrid possibilistic networks’, International Journal of Approximate Reasoning, 44(3), 224–243, (2007).
5. C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole, ‘CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements’, Journal of Artificial Intelligence Research, 21, 135–191, (2004).
6. C. Boutilier, R.I. Brafman, H.H. Hoos, and D. Poole, ‘Reasoning with conditional ceteris paribus preference statements’, in UAI, pp. 71–80, (1999).
7. R.I. Brafman and C. Domshlak, ‘Introducing variable importance tradeoffs into cp-nets’, in UAI, pp. 69–76, (2002).
8. J. Chomicki, ‘Database querying under changing preferences’, Annals of Mathematics and Artificial Intelligence, 50(1-2), 79–109, (2007).
9. S. Coste-Marquis, J. Lang, P. Liberatore, and P. Marquis, ‘Expressive power and succinctness of propositional languages for preference representation’, in KR, pp. 203–212, (2004).
10. C. Domshlak, F. Rossi, K.B. Venable, and T. Walsh, ‘Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques’, in IJCAI, pp. 215–220, (2003).
11. C. Domshlak, F. Rossi, K.B. Venable, and T. Walsh, ‘Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques’, in IJCAI, pp. 215–220, (2003).
12. D. Dubois, H. Fargier, and H. Prade, ‘Beyond min aggregation in multicriteria decision: (ordered) weighted min, discri-min, leximin’, in The Ordered Weighted Averaging Operators - Theory and Applications (R.R. Yager, J. Kacprzyk, eds.), pp. 181–192. Kluwer Acad. Publ., (1997).
13. D. Dubois, J. Lang, and H. Prade, ‘Possibilistic logic’, In Handbook of Logic in Artificial Intelligence and Logic Programming, 439–513, (1994).
14. R. Gérard, S. Kaci, and H. Prade, ‘Ranking alternatives on the basis of generic constraints and examples - a possibilistic approach’, in IJCAI, pp. 393–398, (2007).
15. A. HadjAli, S. Kaci, and H. Prade, ‘Database preferences queries - a possibilistic logic approach with symbolic priorities’, in FoIKS, pp. 291–310, (2008).
16. S. Kaci and H. Prade, ‘Relaxing ceteris paribus preferences with partially ordered priorities’, in ECSQARU, pp. 660–671, (2007).
17. J. Pearl, ‘System Z: A natural ordering of defaults with tractable applications to default reasoning’, in Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge (TARK’90), pp. 121–135, (1995).
18. N. Wilson, ‘An efficient upper approximation for conditional preference’, in ECAI, pp. 472–476, (2006).