Solving linear, min and max constraint systems using CLP based on relational interval arithmetic

DOI10.1016/S0304-3975(96)00198-3zbMath0902.68028MaRDI QIDQ1391939

William J. Older, Eduard Cerny, Pierre Girodias

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

constraint satisfaction problems

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Efficient algorithms for approximate time separation of events

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constraint satisfaction using constraint logic programming
• Consistency in networks of relations
• Accelerating filtering techniques for numeric CSPs
• Networks of constraints: Fundamental properties and applications to picture processing
• Consistency and satisfiability of waveform timing specifications
• Applying interval arithmetic to real, integer, and boolean constraints
• A Theorem on Boolean Matrices

This page was built for publication: Solving linear, min and max constraint systems using CLP based on relational interval arithmetic