Solving linear, min and max constraint systems using CLP based on relational interval arithmetic (Q1391939): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 97 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3345690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying interval arithmetic to real, integer, and boolean constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency and satisfiability of waveform timing specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating filtering techniques for numeric CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of constraints: Fundamental properties and applications to picture processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction using constraint logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank

Latest revision as of 13:21, 28 May 2024

scientific article
Language Label Description Also known as
English
Solving linear, min and max constraint systems using CLP based on relational interval arithmetic
scientific article

    Statements