Pages that link to "Item:Q1597646"
From MaRDI portal
The following pages link to Efficient interval linear equality solving in constraint logic programming (Q1597646):
Displaying 7 items.
- A linear-time transformation of linear inequalities into conjunctive normal form (Q293409) (← links)
- Solving interval constraints by linearization in computer-aided design (Q868685) (← links)
- A simple and efficient Boolean solver for constraint logic programming (Q1357667) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- Solving linear, min and max constraint systems using CLP based on relational interval arithmetic (Q1391939) (← links)
- Symbolic-interval cooperation in constraint programming (Q2958925) (← links)
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP (Q3183129) (← links)