Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs (Q3522065): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Salvatore Ruggieri / rank
Normal rank
 
Property / author
 
Property / author: Salvatore Ruggieri / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-69166-2_9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W81447482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstracting numeric constraints with Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3989943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A canonical form for generalized linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank

Latest revision as of 14:36, 28 June 2024

scientific article
Language Label Description Also known as
English
Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs
scientific article

    Statements

    Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs (English)
    0 references
    0 references
    0 references
    28 August 2008
    0 references
    linear constraints
    0 references
    polyhedra
    0 references
    constraint logic programming
    0 references
    well-moding
    0 references
    definiteness
    0 references

    Identifiers