D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (Q4911127)

From MaRDI portal
Revision as of 11:34, 11 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6144681
Language Label Description Also known as
English
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming
scientific article; zbMATH DE number 6144681

    Statements

    D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (English)
    0 references
    0 references
    0 references
    0 references
    13 March 2013
    0 references
    D-FLAT encoding
    0 references
    dynamic programming algorithms
    0 references

    Identifiers