Logic programs with ordered disjunction

Computational Intelligence

Volumn 20, Issue 2, 2004, Pages 335-357

  Brewka, Gerhard ^a   Niemelä, Ilkka ^b   Syrjänen, Tommi ^b  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b AALTO UNIVERSITY   (Finland)

Author keywords

Answer set semantics; Logic programs; Priorities; Qualitative preferences

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; DECISION MAKING; DECISION THEORY; SEMANTICS; SET THEORY;

ANSWER SET SEMANTICS; ENHANCE DISJUNCTION; QUALITATIVE PREFERENCES;

LOGIC PROGRAMMING;

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

References (37)

1. BALDUCCINI, M., and M. GELFOND. 2003. Diagnostic reasoning with A-Prolog. Theory and Practice of Logic Programming, 3(4-5): 425-461.
2. BARAL, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, UK, ISBN 0521818028.
3. BISTARELLI, S., U. MONTANARI, and F. Rossi. 1997. Semiring-based constraint solving and optimization. Journal of the ACM, 44(2):201-236.
4. BREWKA, G. 1996. Well-founded semantics for extended logic programs with dynamic preferences. Journal of Artificial Intelligence Research, 4:19-36.
5. BREWKA, G. 2002. Logic programming with ordered disjunction. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02). Morgan Kaufmann.
6. BREWKA, G. 2004. Answer sets and qualitative decision making. Synthese 2004, in press, special issue on Non-Monotonic and Uncertain Reasoning in the Focus of Paradigms of Cognition.
7. BREWKA, G., S. BENFERHAT, and D. L. BERRE. 2002. Qualitative choice logic. In Principles of Knowledge Representation and Reasoning: Proceedings of the Eighth International Conference, KR-02. Morgan Kaufmann. Available as Ifl-Report under http: //www.Informatik.uni-leipzig.de/~brewka
8. BREWKA, G., and T. EITER. 1999. Preferred answer sets for extended logic programs. Artificial Intelligence, 109:297-356.
9. BUCCAFURRI, F., N. LEONE, and P. RULLO. 1996. Stable models and their computation for logic programming with inheritance and true negation. Journal of Logic Programming, 27(1):5-43.
10. BUCCAFURRI, F., N. LEONE, and P. RULLO. 1998. Disjunctive ordered logic: Semantics and expressiveness. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98). Morgan Kaufmann, pp. 418-429.
11. BUCCAFURRI, F., N. LEONE, and P. RULLO. 2000. Enhancing disjunctive datalog by constraints. IEEE Transactions on Knowledge and Data Engineering, 12(5):854-860.
12. CHOMICKI, J., and J. LOBO. 2001. Monitors for history-based policies. In Proceedings of the International Workshop on Policies for Distributed Systems and Networks. Springer LNCS 1995, pp. 57-72.
13. CHOMICKI, J., J. LOBO, and S. NAQVI. 2000. A logic programming approach to conflict resolution in policy management. In Principles of Knowledge Representation and Reasoning: Proceedings of the Seventh International Conference, KR-00. Morgan Kaufmann, pp. 121-132.
14. DELGRANDE, J., T. SCHAUB, and H. TOMPITS. 2003. A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming, 3(2): 129-187.
15. DIMOPOULOS, Y., B. NEBEL, and J. KOEHLER. 1997. Encoding planning problems in nonmonotonic logic programs. In Proceedings of the Fourth European Conference on Planning. URL citeseer.nj. nee.com/dimopoulos97encoding.html, pp. 169-181.
16. p complete, Theoretical Computer Science, 114:231-245.
17. EITER, T., N. LEONE, C. MATEIS, G. PFEIFER, and F. SCARCELLO. 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. Morgan Kaufmann.
18. FARGIER, H., J. LANG, and T. SCHIEX. 1993. Selecting preferred solutions in fuzzy constraint satisfaction problems. In Proceedings of the First European Congress on Fuzzy and Intelligent Technologies.
19. FREUDER, E. C., and R. J. WALLACE. 1992. Partial constraint satisfaction. Artificial Intelligence, 58(1):21-70.
20. GELFOND, M., and V. LIFSCHITZ. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385.
21. GELFOND, M., and R. SON. 1998. Reasoning with prioritized defaults. In Logic Programming and Knowledge Representation. Edited by J. Dix, L. M. Pereira, and T. Przymusinski. Springer LNAI 1471, pp. 164-223.
22. GROSOF, B. 1999. Diplomat: Compiling prioritized rules into ordinary logic programs for e-commerce applications (intelligent systems demonstration abstract). In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99).
23. JANHUNEN, T., I. NIEMELÄ, P. SIMONS, and J.-H. You. 2000. Unfolding partiality and disjunctions in stable model semantics. In Principles of Knowledge Representation and Reasoning: Proceedings of the Seventh International Conference. Morgan Kaufmann, pp. 411-419.
24. JUNKER, U. 2002. Preference-based search and multi-criteria optimization. In Proceedings of the Eighteenth National Conference in Artificial Intelligence, AAAI-02. AAAI Press, pp. 34-40.
25. LAENENS, E., and D. VERMEIR. 1990. A fixpoint semantics for ordered logic. Journal of Logic and Computation, 1:159-185.
26. LEONE, N., G. PFEIFER, W. FABER, T. EITER, G. GOTTLOB, S. PERRI, and F. SCARCELLO. 2002. The DLV system for knowledge representation and reasoning. Technical report cs.AI/0211004, arXiv.org.
27. LIFSCHITZ, V. 2002. Answer set programming and plan generation. Artificial Intelligence Journal, 138(1-2):39-54.
28. MAREK, V W., and M. TRUSZCZYŃSKI. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective. Edited by K. R. Apt, V. W. Marek, M. Truszczyński, and D. S. Warren. cs.LO/9809032. Springer-Verlag, Berlin, pp. 375-398
29. 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.
30. NIEMELÄ, I., and P. SIMONS. 1997. Efficient implementation of the stable model and well-founded semantics for normal logic programs. In Proceedings of the Fourth International Conference on Logic Programming and Nonmonotonic Reasoning. Springer-Verlag, Berlin.
31. NIEMELÄ, I., and P. SIMONS. 2000. Extending the Smodels system with cardinality and weight constraints. In Logic-Based Artificial Intelligence. Edited by Jack Minker. Kluwer Academic Publishers. ISBN 0792372247, pp. 491-521.
32. SAKAMA, C., and K. INOUE. 1994. An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning, 13:145-172.
33. SAKAMA, C., and K. INOUE. 2000. Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence, 123(1-2): 185-222. URL citeseer.nj. nec.com/salceuna00prioritized.html
34. SCHAUB, T., and K. WANG. 2001. A comparative study of logic programs with preference. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. IJCAI-01.
35. SCHIEX, T., H. FARGIER, and G. VERFAILLIE. 1995. Valued constraint satisfaction problems: Hard and easy problems. In Proceedings of the Fourteenth International Joint Conference in Artificial Intelligence (IJCAI95). Morgan Kaufmann, pp. 631-639.
36. SOININEN, T. 2000. An approach to knowledge representation and reasoning for product configuration tasks. Ph.D Thesis, Helsinki University of Technology, Finland.
37. SYRJÄNEN, T. 2000. Optimizing configurations. In Proceedings of the ECAI Workshop W02 on Configuration. Berlin, Germany, pp. 85-90,