TCS / Research / Publications / On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic

Reference:

Ilkka Niemelä. On the complexity of the decision problem in propositional nonmonotonic logic. In Proceedings of the 2nd Workshop on Computer Science Logic, pages 226–239, Duisburg, FRG, October 1988. Springer-Verlag.

Suggested BibTeX entry:

@inproceedings{Niemela88:csl,
    address = {Duisburg, FRG},
    author = {Ilkka Niemel{\"a}},
    booktitle = {Proceedings of the 2nd Workshop on Computer Science Logic},
    month = {October},
    pages = {226--239},
    publisher = {Springer-Verlag},
    title = {On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic},
    year = {1988},
}

This work is not available online here.

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