Answer sets: From constraint programming towards qualitative optimization

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2923, Issue , 2004, Pages 34-46

  Brewka, Gerhard ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; FORMAL LOGIC; KNOWLEDGE REPRESENTATION; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING; COMPUTER PROGRAMMING; LOGIC PROGRAMMING;

CONSTRAINT PROGRAMMING; LOGIC PROGRAMS; QUALITATIVE OPTIMIZATION;

LOGIC PROGRAMMING; PROBLEM SOLVING;

ANSWER SET; ANSWER SET PROGRAMMING; CONSTRAINT PROGRAMMING; KNOWLEDGE REPRESENTATION LANGUAGE; QUALITATIVE OPTIMIZATION; STABLE MODEL;

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

References (28)

1. C. Baral. Knowledge representation, reasoning and declarative problem solving, Cambridge University Press, 2003.
2. C. Baral, C. Uyan, Declarativ specification and solution of combinatorial auctions using logic programming, Proc. LPNMR'01, Springer Verlag, 2001.
3. M. Balduccini, M. Gelfond, Logic Programs with Consistency-Restoring Rules, In P. Doherty, J. McCarthy, M.-A. Williams (editors), International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series, Mar 2003.
4. G. Brewka, Logic programming with ordered disjunction, In Proc. AAAI-02, 100-105, Morgan Kaufmann, 2002.
5. G. Brewka and T. Eiter, Preferred answer sets for extended logic programs, Artificial Intelligence 109: 297-356, 1999.
6. G. Brewka, I. Niemelä, and M. Truszczynski, Answer set optimization, Proc. IJCAI-03, 867-872, Acapulco, 2003.
7. G. Brewka, I. Niemelä, and T. Syrjänen, Implementing ordered disjunction using answer set solvers for normal programs, Proc. JELIA 2002, Springer Verlag, 2002.
8. F. Buccafurri, N. Leone, P. Rullo Enhancing disjunctive datalog by constraints, IEEE Transactions on Knowledge and Data Engineering, 12(5), 845-860, 2000.
9. L. Console, D.T. Dupre, P. Torasso, On the relatio between abduction and deduction, Journal of Logic and Computation 1(5):661-690, 1991.
10. C. V. Damasio and L. M. Pereira, A Survey on Paraconsistent Semantics for Extended Logic Programas, in: D.M. Gabbay and Ph. Smets (eds.), Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 2, pp 241-320, Kluwer Academic Publishers, 1998.
11. O. Dressler, P. Struss, The consistency-based approach to automated diagnosis of devices, in: G. Brewka (ed), Principles of Knowledge Representation, CSLI Publications, 1996.
12. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. The kr system dlv: Progress report, comparisons and benchmarks, Proc. Principles of Knowledge Representation and Reasoning, KR-98, Morgan Kaufmann, 1998.
13. T. Eiter, W. Faber, N. Leone, G. Pfeifer, The Diagnosi Frontend of the dlv System, AI Communications 12(1-2): 99-111, 1999.
14. T. Eiter, M. Fink, G. Sabbatini, H. Tompits A generic approach for knowledge-based information-site selection, Proc. Principles of Knowledge Representation and Reasoning, KR-02, Toulouse, Morgan Kaufman, 2002
15. T. Eiter, W. Faber, N. Leone, G. Pfeifer, A. Polleres, Answer se planning under action costs, Proc. JELIA 2002, Springer Verlag, 2002, extended version to appear in Journal of Artificial Intelligence Research.
16. K. Konolige, Abduction versus closure in causal theories, Artificial Intelligence 53: 255-272, 1992.
17. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Computing, 9:365-385, 1991.
18. V. Lifschitz, Answer set programming and plan generation, Artificial Intelligence, 138(1-2):39-54, 2002.
19. V. Marek and M. Truszczynski, Stable models and an alternative logic programming paradigm, in: The Logic Programming Paradigm: a 25-Year Perspective, 1999.
20. I. Niemelä, Logic programs with stable model semantics as a constraint programming paradigm, Annals of Mathematics and Artificial Intelligence, 25(3,4):241-273, 1999.
21. I. Niemelä and P. Simons, Efficient implementation of the stable model and well-founded semantics for normal logic programs, Proc. 4th Intl. Conference on Logic Programming and Nonmonotonic Reasoning, Springer Verlag, 1997.
22. Y. Peng and J. Reggia, Abductive inference models for diagnostic problem solving, Symbolic Computation - Artificial Intelligence, Springer, 1990.
23. L. M. Pereira, J. J. Alferes and J. Aparicio. Contradiction Removal within Well Founded Semantics, in: A. Nerode, W. Marek, V. S. Subrahmanian (editors), Logic Programming and Nonmonotonic Reasoning, pages 105-119, MIT Press, 1991.
24. D. Poole, An architecture for default and abductive reasoning, Computational Intelligence, 5(1): 97-110, 1989.
25. C. Sakama and K. Inoue, Prioritized logic programming and its application to commonsense reasoning, Artificial Intelligence, 123(1-2):185-222, 2000.
26. T. Schaub and K. Wang, A comparative study of logic programs with preference, In Proc. Intl. Joint Conference on Artificial Intelligence, IJCAI-01, 2001.
27. P. Simons, I. Niemelä, and T. Soininen, Extending and implementing the stable model semantics, Artificial Intelligence, 138(1-2):181-234, 2002.
28. T. Soininen, An Approach to Knowledge Representation and Reasoning for Product Configuration Tasks, PhD thesis, Helsinki University of Technology, Finland, 2000.