On the complexity of Boolean unification (Q293360)

From MaRDI portal
Revision as of 16:52, 3 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57383729, #quickstatements; #temporary_batch_1706974296281)
scientific article
Language Label Description Also known as
English
On the complexity of Boolean unification
scientific article

    Statements

    title
    On the complexity of Boolean unification (English)
    0 references
    author
    Franz Baader
    0 references
    publication date
    9 June 2016
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    automatic theorem proving
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q17
    0 references
    68T15
    0 references
    zbMATH DE Number
    6590751
    0 references
    Wikidata QID
    Q57383729
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q293360&oldid=15688465"
    Powered by MediaWiki