Interval propagation to reason about sets: Definition and implementation of a practical language
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4162324 (Why is no real title available?)
- scientific article; zbMATH DE number 3819057 (Why is no real title available?)
- scientific article; zbMATH DE number 3976287 (Why is no real title available?)
- scientific article; zbMATH DE number 3989126 (Why is no real title available?)
- scientific article; zbMATH DE number 4049047 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3706504 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 3466489 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1140683 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- A generic arc-consistency algorithm and its specializations
- A language and a program for stating and solving combinatorial problems
- Compilation of set terms in the logic data language (LDL)
- Consistency in networks of relations
- Covering, Packing and Knapsack Problems
- Extended unification algorithms for the integration of functional programming into logic programming
- Interval computation as deduction in chip
- Introducing global constraints in CHIP
- Logic programming with sets
- REF-ARF: A system for solving problems stated as procedures
- Set constructors in a logic database language
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Solving a cutting-stock problem with the constraint logic programming language CHIP
- Solving large combinatorial problems in logic programming
- {log}: A language for programming in logic with finite sets
Cited in
(23)- Solving quantifier-free first-order constraints over finite sets and binary relations
- Lazy constraint imposing for improving the path constraint
- scientific article; zbMATH DE number 7552283 (Why is no real title available?)
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership
- Solving set-valued constraint satisfaction problems
- \(\text{ECL}^{\text{i}}\text{PS}^{\text{e}}\) -- from LP to CLP
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
- Symmetry breaking constraints for value symmetries in constraint satisfaction
- Enhancing set constraint solvers with lexicographic bounds
- Solving Kirkman's schoolgirl problem in a few seconds
- Symmetry breaking revisited
- scientific article; zbMATH DE number 1630126 (Why is no real title available?)
- Global domain views for expressive and cross-domain constraint programming
- Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- scientific article; zbMATH DE number 1696811 (Why is no real title available?)
- Local consistency for extended CSPs
- Multiset variable representations and constraint propagation
- Cardinal: a finite sets constraint solver
- A constraint propagation approach to structural model based image segmentation and recognition
- Adding partial functions to constraint logic programming with sets
- Generic incremental algorithms for local search
- Contractibility for open global constraints
This page was built for publication: Interval propagation to reason about sets: Definition and implementation of a practical language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679421)
