TCS / Research / Publications / Answer Set Programming: A Declarative Approach to Solving Search Problems
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Answer Set Programming: A Declarative Approach to Solving Search Problems

Reference:

Ilkka Niemelä. Answer set programming: A declarative approach to solving search problems. In Proceedings of the 10th European Conference on Logics in Artificial Intelligence, volume 4160 of Lecture Notes in Computer Science, pages 15–18. Springer, 2006.

Suggested BibTeX entry:

@inproceedings{Niemela:JELIA2006,
    author = {Ilkka Niemel{\"a}},
    booktitle = {Proceedings of the 10th European Conference on Logics in Artificial Intelligence},
    pages = {15--18},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Answer Set Programming: A Declarative Approach to Solving Search Problems},
    volume = {4160},
    year = {2006},
}

This work is not available online here.

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.