TCS / Research / Publications / Bounded Model Checking, Answer Set Programming, and Fixed Points
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Bounded Model Checking, Answer Set Programming, and Fixed Points

Reference:

Ilkka Niemelä. Bounded model checking, answer set programming, and fixed points. In Proceedings of the CAV'06 Workshop on Bounded Model Checking (BMC06), page 9, 2006. Abstract of an invited talk.

Keywords:

Logic programming; stable models; linear time temporal logic; bounded model checking

Suggested BibTeX entry:

@inproceedings{Niemela:BMC06,
    author = {Ilkka Niemel{\"a}},
    booktitle = {Proceedings of the CAV'06 Workshop on Bounded Model Checking (BMC06)},
    note = {Abstract of an invited talk},
    pages = {9},
    title = {Bounded Model Checking, Answer Set Programming, and Fixed Points},
    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.