TCS / Research / Publications / Integrating Answer Set Programming and Satisfiability Modulo Theories
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Integrating Answer Set Programming and Satisfiability Modulo Theories

Reference:

Ilkka Niemelä. Integrating answer set programming and satisfiability modulo theories. In Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009, volume 5753 of Lecture Notes in Computer Science, page 3, 2009.

Suggested BibTeX entry:

@inproceedings{Niemela:LPNMR2009,
    author = {Ilkka Niemel{\"a}},
    booktitle = {Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009},
    pages = {3},
    series = {Lecture Notes in Computer Science},
    title = {Integrating Answer Set Programming and Satisfiability Modulo Theories},
    volume = {5753},
    year = {2009},
}

This work is not available online here.

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