Lazy Constraint Imposing for Improving the Path Constraint

DOI10.1016/j.entcs.2009.10.020zbMath1291.68380OpenAlexW2140968705MaRDI QIDQ5170285

Francisco Azevedo, Ruben Duarte Viegas

Publication date: 23 July 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.10.020

zbMATH Keywords

constraint programmingpath constraintgraph constraint propagation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Biochemistry, molecular biology (92C40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Lazy Constraint Imposing for Improving the Path Constraint

Uses Software

• Cardinal
• CaSPER
• CPGraph
• GRASPER

Cites Work

• Interval propagation to reason about sets: Definition and implementation of a practical language
• Cardinal: a finite sets constraint solver
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Handbook of production scheduling.
• Planning and Scheduling in Manufacturing and Services
• CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
• Extended unification algorithms for the integration of functional programming into logic programming
• Theory and Application of Graphs
• Lazy Constraint Imposing for Improving the Path Constraint
• Principles and Practice of Constraint Programming – CP 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lazy Constraint Imposing for Improving the Path Constraint