A logic of soft constraints based on partially ordered preferences

Journal of Heuristics

Volumn 12, Issue 4-5, 2006, Pages 241-262

  Wilson, Nic ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Possibilistic logic; Preferences; Semiring based CSPs; Soft constraints

Indexed keywords

COMPUTATION THEORY; EMBEDDED SYSTEMS; FORMAL LOGIC; HEURISTIC METHODS; SET THEORY;

POSSIBILISTIC LOGIC; PREFERENCES; SEMIRING-BASED CSPS; SOFT CONSTRAINTS;

CONSTRAINT THEORY;

EID: 33646554453     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-006-6347-5     Document Type: Conference Paper

References (25)

1. Benferhat, S., S. Lagrue, and O. Papini. (2002). "Reasoning with Partially Ordered Information in a Possibilistic Logic Framework." In Proceedings of IPMU 2002, pp. 1047-1052.
2. Bertele, U. and F. Brioschi. (1972). Nonserial Dynamic Programming, Academic Press.
3. Bistarelli, S., T. Fruewirth, M. Marte, and F. Rossi. (2004). "Soft Constraint Propagation and Solving in Constraint Handling Rules." Computational Intelligence, Special Issue on Preferences in AI and CP.
4. Bistarelli, S., U. Montanari, F. Rossi, T. Schiex, G. Verfaillie, and H. Fargier. (1999). "Semiring-Based CSPs and Valued CSPs: Frameworks, Properties and Comparison." Constraints 4(3), 199-240.
5. Bistarelli, S., U. Montanari, and F. Rossi. (1997). "Semiring-Based Constraint Solving and Optimization." Journal of the ACM (JACM) 44(2). 201-236.
6. Bistarelli, S., U. Montanari, and F. Rossi. (2001). "Semiring-Based Constraint Logic Programming: Syntax and Semantics." ACM Transactions on Programming Languages and Systems.
7. Bistarelli, S., U. Montanari, and F. Rossi. (2002). "Soft Concurrent Constraint Programming." In Proc. 11th European Symposium on Programming (ESOP). Lecture Notes in Computer Science (LNCS), Springer, pp. 53-67.
8. Bistarelli, S. (2004). Semirings for Soft Constraint Solving and Programming, Springer.
9. Boutilier, C., R.I. Brafman, H.H. Hoos, and D. Poole. (1999). "Reasoning with Conditional Ceteris Paribus Preference Statements." In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI99), pp. 71-80.
10. Boutilier, C., R. Brafman, C. Domshlak, H. Hoos, and D. Poole. (2004). "CP-Nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Statements." JAIR 21, 135-191.
11. Dechter, R. and I. Rish. (2003). "Mini-Buckets: A General Scheme for Bounded Inference." Journal of the ACM 50(2), 107-153.
12. Dechter. R. (1999),"Bucket Elimination: A Unifying Framework for Reasoning." Artificial Intelligence, 113.
13. Dubois, D., J. Lang, and H. Prade. (1991). "Timed Possihilistic Logic." Fundamente! Informaticae, XV.
14. Dubois, D., J. Lang, and H. Prade. (1994). Possibilistic Logic, Pages 439-513. In: Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, D. Gabbay, C. Hogger and J. Robinson (eds.), Oxford University Press.
15. Fargier, H., J. Lang, and T. Schiex. (1993). "Selecting Preferred Solutions in Fuzzy Constraint Satisfaction Problems." In Proc. of the first European Congress on Fuzzy and Intelligent Technologies.
16. Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York.
17. Kohlas, J. and P. Shenoy. (2000). Computation in Valuation Algebras. In: Kohlas, J., Moral, S., (eds.) Algorithms for Uncertainty and Defeasible Reasoning. Volume 5, Handbook of Defeasible Reasoning. Kluwer Academic Publishers.
18. Kohlas, J. (2003). Information Algebras, Springer. London.
19. Schiex, T., H. Fargier, and G. Verfaillie. (1995). "Valued Constraint Satisfaction Problems: Hard and Easy Problems." In Proc. IJCAI-95, pp. 631-637.
20. Shenoy, P.P. and G. Shafer. (1990). "Axioms for Probability and Belief Function Propagation," In Uncertainty in Artificial Intelligence 4, pp. 575-610.
21. Shenoy, P. P. (1992). "Valuation-Based Systems: A Framework for Managing Uncertainty in Expert Systems." Fuzzy Logic for the Management of Uncertainty.
22. Wilson, N. (2003). "A Logic of Partially Satisfied Constraints." In Soft'03: Fifth International Workshop on Soft Constraints.
23. Wilson, N. (2004a). "Extending CP-Nets with Stronger Conditional Preference Statements." In Proceedings of AAAI-04, pp. 735-741.
24. Wilson, N. (2004b). "Soft Constraints with Partially Ordered Preferences (short paper)." In Proc. European Conference on Artificial Intelligence, pp. 1111-1112.
25. Wilson, N. (2005). "Decision Diagrams for the Computation of Semiring Valuations." In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 331-336.