Recognizing renamable generalized propositional Horn formulas is NP- complete (Q1804878)

From MaRDI portal
Revision as of 05:45, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Recognizing renamable generalized propositional Horn formulas is NP- complete
scientific article

    Statements

    title
    Recognizing renamable generalized propositional Horn formulas is NP- complete (English)
    0 references
    author
    Thomas Eiter
    0 references
    Pekka Kilpeläinen
    0 references
    Heikki Mannila
    0 references
    publication date
    17 May 1995
    0 references
    zbMATH Keywords
    Horn formulas
    0 references
    satisfiability problem
    0 references
    NP-completeness
    0 references

    Identifiers

    zbMATH DE Number
    756142
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1804878&oldid=26501722"
    Powered by MediaWiki