Metalevel algorithms for variant satisfiability (Q2413027)

From MaRDI portal
Revision as of 13:59, 26 October 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q130200143, #quickstatements; #temporary_batch_1729947016210)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Metalevel algorithms for variant satisfiability
scientific article

    Statements

    title
    Metalevel algorithms for variant satisfiability (English)
    0 references
    author
    Stephen Skeirik
    0 references
    José Meseguer
    0 references
    publication date
    6 April 2018
    0 references
    zbMATH Keywords
    finite variant property (FVP)
    0 references
    folding variant narrowing
    0 references
    satisfiability in initial algebras
    0 references
    metalevel algorithms
    0 references
    reflection
    0 references
    Maude
    0 references
    describes a project that uses
    ITP
    0 references
    SCC
    0 references
    Maude
    0 references
    cites work
    Q2762630
    0 references
    Q5309032
    0 references
    Q5310200
    0 references
    Q4038726
    0 references
    Q4385532
    0 references
    Q3221381
    0 references
    Q3839051
    0 references
    Q3687683
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68V15
    0 references
    18C10
    0 references
    68Q42
    0 references
    zbMATH DE Number
    6856983
    0 references
    OpenAlex ID
    W2791470433
    0 references
    Wikidata QID
    Q130200143
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2413027&oldid=37863028"
    Powered by MediaWiki