Strong local consistency algorithms for table constraints
From MaRDI portal
Publication:272003
DOI10.1007/S10601-014-9179-1zbMATH Open1334.90169OpenAlexW2086200290MaRDI QIDQ272003FDOQ272003
Anastasia Paparrizou, Kostas Stergiou
Publication date: 20 April 2016
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01276179/file/maxRPWC_cons15.pdf
Recommendations
Cites Work
- Partition search for non-binary constraint satisfaction
- Domain filtering consistencies for non-binary constraints
- An optimal coarse-grained arc consistency algorithm
- Domain filtering consistencies
- Second-Order Consistencies
- Title not available (Why is that?)
- Path Consistency by Dual Consistency
- Generalized Arc Consistency for Positive Table Constraints
- New algorithms for max restricted path consistency
- STR2: optimized simple tabular reduction for table constraints
- On the minimality and global consistency of row-convex constraint networks
- Preference-Based Problem Solving for Constraint Programming
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
Cited In (1)
Uses Software
This page was built for publication: Strong local consistency algorithms for table constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q272003)