Complex Preferences for Answer Set Optimization

Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference, KR 2004

Volumn , Issue , 2004, Pages 213-223

  Brewka, Gerhard ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE REPRESENTATION;

ANSWER SET; COMPLEX PREFERENCES; DESCRIPTION LANGUAGES; LOGIC PROGRAMS; OPTIMISATIONS; SET OPTIMIZATIONS;

LOGIC PROGRAMMING;

EID: 84857234381     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. Andreka, H.; Ryan, M.; and Schobbens, P.-Y. 2002. Operators and laws for combining preference relations. Journal of Logic and Computation 12(1):13-53.
2. Arrow, K. 1950. A difficulty in the concept of social welfare. Journal of Political Economy 58:328-346.
3. Baral, C., and Uyan, C. 2001. Declarative specification and solution of combinatorial auctions using logic programming. In Proceedings LPNMR-01, 186-198. Springer LNCS 2173.
4. Baral, C. 2003. Knowledge representation, reasoning and declarative problem solving. Cambridge University Press. ISBN 0521818028.
5. Benferhat, S.; Cayrol, C.; Dubois, D.; Lang, J.; and Prade, H. 1993. Inconsistency management and prioritized syntax-based entailment. In Proceedings International Joint Conference on Artificial Intelligence, IJCAI-93, 640-645. Morgan Kaufmann.
6. Bistarelli, S.; Montanari, U.; and Rossi, F. 1997. Semiringbased constraint solving and optimization. Journal of the ACM 44(2):201-236.
7. Boutilier, C.; Brafman, R.; Hoos, H.; and Poole, D. 1999. Reasoning with conditional ceteris paribus preference statements. In Proc. Uncertainty in Artificial Intelligence, UAI-99, 71-80.
8. Boutilier, C.; Brafman, R.; Domshlak, C.; Hoos, H.; and Poole, D. 2004. CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. Journal of Artificial Intelligence Research to appear.
9. Brafman, R., and Dimopoulos, Y. 2003. A new look at the semantics and optimization methods of CP-networks. In Proceedings International Joint Conference on Artificial Intelligence, IJCAI-03, 1033-1038. Morgan Kaufmann.
10. Brewka, G.; Benferhat, S.; and Le Berre, D. 2002. Qualitative choice logic. In Principles of Knowledge Representation and Reasoning: Proceedings of the 8th International Conference, KR-02, 158-169. Morgan Kaufmann. journal version to appear in Artificial Intelligence.
11. Brewka, G.; Niemelä, I.; and Syrjänen, T. 2002. Implementing ordered disjunction using answer set solvers for normal programs. In Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA 2002), 444-455. Springer Verlag.
12. Brewka, G.; Niemelä, I.; and Truszczyński, M. 2003. Answer set optimization. In Proceedings International Joint Conference on Artificial Intelligence, IJCAI-03, 867-872. Morgan Kaufmann.
13. Brewka, G. 2004a. Answer sets: From constraint programming towards qualitative optimization. In Proceedings LPNMR-04, 34-46. Springer Verlag.
14. Brewka, G. 2004b. A rank based description language for qualitative preferences. In submitted for publication.
15. Buccafurri, F.; Leone, N.; and Rullo, P. 2000. Enhancing disjunctive datalog by constraints. IEEE Transactions on Knowledge and Data Engineering 12(5):845-860.
16. Eiter, T.; Leone, N.; Mateis, C.; Pfeifer, G.; and Scarcello, F. 1998. The KR system dlv: Progress report, comparisons and benchmarks. In Principles of Knowledge Representation and Reasoning: Proceedings of the 6th International Conference, KR-98, 406-417. Morgan Kaufmann.
17. Eiter, T.; Faber, W.; Leone, N.; and Pfeifer, G. 1999. The diagnosis frontend of the dlv system. AI Communications 12(1-2):99-111.
18. Eiter, T.; Faber, W.; Leone, N.; Pfeifer, G.; and Polleres, A. 2002a. Answer set planning under action costs. In Proc. JELIA 2002, volume 12(1-2), 186-197. Springer LNCS 2424.
19. Eiter, T.; Fink, M.; Sabbatini, G.; and Tompits, H. 2002b. A generic approach for knowledge-based information-site selection. In Proc. 8th Intl. Conference on Principles of Knowledge Representation and Reasoning, KR-02, 459-469. Morgan Kaufmann.
20. Fargier, H.; Lang, J.; and Schiex, T. 1993. Selecting preferred solutions in fuzzy constraint satisfaction problems. In Proceedings of the First European Congress on Fuzzy and Intelligent Technologies.
21. Freuder, E., and Wallace, R. 1992. Partial constraint satisfaction. Artificial Intelligence 58(1):21-70.
22. Gelfond, M., and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365-385.
23. Janhunen, T.; Niemelä, I.; Simons, P.; and You, J.-H. 2000. Unfolding partiality and disjunctions in stable model semantics. In Principles of Knowledge Representation and Reasoning: Proceedings of the 7th International Conference, 411-419. Morgan Kaufmann Publishers.
24. Lang, J. 2004. Logical preference representation and combinatorial vote. Annals of Mathematics and Artificial Intelligence to appear.
25. Lifschitz, V., and Turner, H. 1994. Splitting a logic program. In International Conference on Logic Programming, 23-37.
26. Lifschitz, V. 2002. Answer set programming and plan generation. Artificial Intelligence Journal 138(1-2):39-54.
27. Marek, V., and Truszczyński, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective, 375-398. Springer Verlag.
28. Niemelä, I., and Simons, P. 1997. Efficient implementation of the stable model and well-founded semantics for normal logic programs. In Proceedings of the 4th Intl. Conference on Logic Programming and Nonmonotonic Reasoning, 421-430. Springer Verlag.
29. Niemelä, I., and Simons, P. 2000. Extending the Smodels system with cardinality and weight constraints. In Minker, J., ed., Logic-Based Artificial Intelligence. Kluwer Academic Publishers.
30. Niemelä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3,4):241-273.
31. Schaub, T., and Wang, K. 2001. A comparative study of logic programs with preference. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, IJCAI-01, 597-602.
32. Schiex, T.; Fargier, H.; and Verfaillie, G. 1995. Valued constraint satisfaction problems: Hard and easy problems. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, IJCAI-95, 631-637.
33. Simons, P.; Niemelä, I.; and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2):181-234.
34. Soininen, T. 2000. An Approach to Knowledge Representation and Reasoning for Product Configuration Tasks. Ph.D. Dissertation, Helsinki University of Technology, Finland.
35. Son, R., and Pontelli, E. 2004. Planning with preferences using logic programming. In Proc. 7th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 04, 247-260. Springer LNAI 2923.