Cardinal: a finite sets constraint solver

DOI10.1007/s10601-006-9012-6zbMath1118.68653OpenAlexW2001769932MaRDI QIDQ879977

Francisco Azevedo

Publication date: 10 May 2007

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-006-9012-6

zbMATH Keywords

CLP, Constraint Logic ProgrammingPI, Primary InputTG, Test Generation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (7)

Combining Two Structured Domains for Modeling Various Graph Matching Problems ⋮ Multiset variable representations and constraint propagation ⋮ Probabilistic constraints for nonlinear inverse problems ⋮ Improved filtering for weighted circuit constraints ⋮ Lazy Constraint Imposing for Improving the Path Constraint ⋮ Solving quantifier-free first-order constraints over finite sets and binary relations ⋮ Cardinal

Uses Software

• CLAIRE
• CPLEX
• CSPLib
• OR-Library
• CaSPER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval propagation to reason about sets: Definition and implementation of a practical language
• Bicoloring Steiner triple systems
• CLAIRE: combining sets, search and rules to better express algorithms
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Cardinal: a finite sets constraint solver