A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
From MaRDI portal
Publication:5403428
DOI10.2478/v10006-011-0058-2zbMath1288.90090OpenAlexW2049055139MaRDI QIDQ5403428
Miguel A. Salido, Marlene Arangu
Publication date: 26 March 2014
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/v10006-011-0058-2
Related Items
Selection of search strategies for solving 3-SAT problems, Actuator fault diagnosis for flat systems: A constraint satisfaction approach
Cites Work
- Arc consistency for factorable relations.
- A generic arc-consistency algorithm and its specializations
- Consistency in networks of relations
- Using constraint metaknowledge to reduce arc consistency computation
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- An optimal coarse-grained arc consistency algorithm
- Input Constraints Handling in an MPC/Feedback Linearization Scheme
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item