Extended semantics and optimization algorithms for CP-networks

Computational Intelligence

Volumn 20, Issue 2, 2004, Pages 218-245

  Brafman, Ronen I ^a   Dimopoulos, Yannis ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

Answer set programming; Cp nets; Graphical models; Knowledge representation; Non monotonic logic programs; Preference elicitation

Indexed keywords

ALGORITHMS; GRAPH THEORY; INTELLIGENT AGENTS; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; SEMANTICS;

ANSWER-SET PROGRAMMING; CP-NETWORKS; GRAPHIC MODELS; NON-MONOTONIC LOGIC PROGRAMS; PREFERENCE ELICITATION;

DECISION THEORY;

EID: 2442589725     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.0824-7935.2004.00236.x     Document Type: Conference Paper

References (25)

1. ASPVALL, B., M. PLASS, and R. TARJAN. 1979. A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Information Proceedings Letters 8(3):121-123.
2. BECKER, A., and D. GEIGER. 1994. Approximation algorithms for the loop cutset problem. In Proceedings of Tenth Conference on Uncertainty in AI, pp. 60-68.
3. BOUTILIER, C., R. I. BRAFMAN, H. H. HOOS, and D. POOLE. 1999. Reasoning with conditional ceteris paribus preference statements. In Proceedings of the 15th Conference on Uncertainty in AI, pp. 71-80.
4. BRAFMAN, R. I., and D. FRIEDMAN. 2003. Presentation adaptation for rich media messages. STRIMM Consortium Working Paper.
5. BREWKA, G., I. NIEMELÄ, and T. SYRJÄNEN. 2002. Implementing ordered disjunction using answer set solvers for normal programs. In Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA' 02), pages 444-455, Cosenza, Italy, Springer-Verlag.
6. BREWKA, G., I. NIEMELÄ, and M. TRUSZCZYNSKI. 2003. Answer set optimization. In Proceedings of IJCAI'03.
7. DELGRANDE, J. P., T. SCHAUB, and H. TOMPITS. 2003. A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming, 3:129-187.
8. DELL'ARMI, T., W. FABER, G. IELPA, C. KOCH, N. LEONE, S. PERRI, and G. PFEIFER. 2001. System description: DLV. In Proceedings of LPNMR-01.
9. DIMOPOULOS, Y., B. NEBEL, and F. TONI. 2002. On the computational complexity of assumption-based argumentation for default reasoning. Artificial Intelligence, 141:57-78
10. DOMSHLAK, C., and R. I. BRAFMAN. 2002. CP-Nets - reasoning and consistency testing. In Proceedings of KR'02.
11. DOMSHLAK, C., R. I. BRAFMAN, and E. S. SHIMONY. 2001. Preference-based configuration of web page content. In Proceedings of IJCAI'01.
12. DOYLE, J., and M. WELLMAN. 1994. Representing preferences as ceteris paribus comparatives. In AAAI Spring Symposium on Decision-Theoretic Planning.
13. EVEN, G., J. NAOR, S. RAO, and B. SCHIEBER. 1995. Approximating minimum feedback sets and multi-cuts in directed graphs. In Proceedings of the Fourth International Conference on Integer Programming and Combinatorial Optimization, pp. 14-28.
14. GAREY, M., and D. JOHNSON. 1979. Computers and Intractability - A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York.
15. GELFOND, M., and V. LIFSCHITZ. 1988. The stable model semantics for logic programming. In Proceedings of ICSLP-88.
16. GUDES, E., C. DOMSHLAK, and N. ORLOV. 2002. Remote conferencing with multimedia objects. In Proceedings of the Second International Workshop on Multimedia Data Document Engineering (MDDE'02).
17. HANSON., S. O. 1996. What is a ceteris paribus preference. Journal of Philosophical Logic, 25:307-332.
18. JANHUNEN, T., I. NIEMELÄ, P. SIMONS, and J-H. YOU. 2000. Unfolding partiality and disjunctions in stable model semantics. In Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning, KR'00.
19. KEENEY, R. L., and H. RAIFFA. 1976. Decisions with Multiple Objectives: Preferences and Value Trade-offs. Wiley, New York.
20. MAREK, V., and M. TRUSZCZYNSKI. 1991. Autoepistemic logic. Journal of the ACM, 38:587-618.
21. NIEMELÄ, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25:241-273.
22. PEARL, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo.
23. SACCA, D., and C. ZANIOLO. 1990. Stable models and non-determinism in logic programs with negation. In Proceedings of PODS'90.
24. SAKAMA, C., and K. INOUE. 1996. Representing priorities in logic programs. In Proceedings of Joint International Conference and Syposium on Logic Programming, JICSLP'96.
25. SYRJÄNEN, T., and I. NIEMELÄ. 2001. The Smodels system. In Proceedings of LPNMR-01.