On the complexity of the decision problem in propositional nonmonotonic logic

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    1 Citation (Scopus)
    Original languageEnglish
    Title of host publicationCSL 1988
    Subtitle of host publication2nd Workshop on Computer Science Logic Duisburg, FRG, October 3–7, 1988. Proceedings
    EditorsEgon Börger, Hans Kleine Büning, Michael M. Richter
    Pages226-239
    Number of pages14
    ISBN (Electronic)978-3-540-46736-6
    DOIs
    Publication statusPublished - 1989
    MoE publication typeA4 Article in a conference publication

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Berlin Heidelberg
    Volume385
    ISSN (Print)0302-9743

    Cite this

    Niemelä, I. (1989). On the complexity of the decision problem in propositional nonmonotonic logic. In E. Börger, H. Kleine Büning, & M. M. Richter (Eds.), CSL 1988 : 2nd Workshop on Computer Science Logic Duisburg, FRG, October 3–7, 1988. Proceedings (pp. 226-239). (Lecture Notes in Computer Science ; Vol. 385). https://doi.org/10.1007/BFb0026304