Abstracting numeric constraints with Boolean functions (Q294784): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127351599, #quickstatements; #temporary_batch_1722494602859
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two classes of Boolean functions for dependency analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing logic programs using “prop”-ositional logic programs and a magic wand / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple polynomial groundness analysis for logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518882 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(00)00081-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991816648 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127351599 / rank
 
Normal rank

Latest revision as of 07:44, 1 August 2024

scientific article
Language Label Description Also known as
English
Abstracting numeric constraints with Boolean functions
scientific article

    Statements

    Abstracting numeric constraints with Boolean functions (English)
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    abstract interpretation
    0 references
    compilers
    0 references
    constraint programming
    0 references

    Identifiers