A linear algorithm for renaming a set of clauses as a Horn set (Q1318709)

From MaRDI portal
Revision as of 06:42, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/tcs/Hebrard94, #quickstatements; #temporary_batch_1731475607626)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear algorithm for renaming a set of clauses as a Horn set
scientific article

    Statements

    title
    A linear algorithm for renaming a set of clauses as a Horn set (English)
    0 references
    publication date
    5 April 1994
    0 references
    zbMATH Keywords
    renaming algorithm
    0 references
    Horn set
    0 references
    linear complexity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    03B35
    0 references
    03D15
    0 references
    68Q25
    0 references
    68T15
    0 references
    zbMATH DE Number
    540861
    0 references
    OpenAlex ID
    W2031435353
    0 references
    Wikidata QID
    Q56482742
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1318709&oldid=37898570"
    Powered by MediaWiki