The following pages link to (Q4473037):
Displaying 15 items.
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework (Q438582) (← links)
- New algorithms for bidirectional singleton arc consistency (Q474731) (← links)
- Promoting robust black-box solvers through competitions (Q606901) (← links)
- Identifying and exploiting problem structures using explanation-based constraint programming (Q857888) (← links)
- Data refinement and singleton failures refinement are not equivalent (Q931436) (← links)
- Local consistency for extended CSPs (Q1035707) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Revisiting restricted path consistency (Q1699521) (← links)
- Neighborhood singleton consistencies (Q2331105) (← links)
- Theoretical analysis of singleton arc consistency and its extensions (Q2389615) (← links)
- Efficient algorithms for singleton arc consistency (Q2430358) (← links)
- (Q4823614) (← links)
- Relative Store Fragments for Singleton Abstraction (Q5233240) (← links)
- On the Integration of Singleton Consistencies and Look-Ahead Heuristics (Q5302725) (← links)
- (Q5416577) (← links)