Back to Results
First PageMeta Content
Artificial intelligence / Local consistency / Constraint satisfaction problem / Constraint satisfaction / Constraint inference / Decomposition method / Complexity of constraint satisfaction / Constraint programming / Software engineering / Computer programming


Artificial Intelligence[removed]–156 Decomposable constraints ✩ Ian Gent a , Kostas Stergiou b,∗ , Toby Walsh c a APES Research Group, School of Computer Science, University of St Andrews, Scotland, UK b APE
Add to Reading List

Document Date: 2006-01-21 00:51:04


Open Document

File Size: 183,90 KB

Share Result on Facebook

City

York / /

Company

Elsevier Science B.V. / /

Country

United Kingdom / Scotland / /

/

Facility

University of York / University of Strathclyde / University of St Andrews / /

IndustryTerm

generalized forward checking algorithms / real-life applications / nFC1 algorithm / generalized forward checking algorithm / nFC0 algorithm / forward checking algorithm / search tree / arc-consistency algorithm / cartesian product / nFC5 algorithms / strongest generalized forward checking algorithm / /

Organization

School of Computer Science / University of St Andrews / Department of Computer Science / University of York / University of Strathclyde / Glasgow / /

Person

Ian Gent / Toby Walsh / /

Position

Corresponding author / /

Technology

forward checking algorithm / maintaining arc-consistency algorithm / artificial intelligence / nFC1 algorithm / strongest generalized forward checking algorithm / generalized forward checking algorithm / decomposable constraints Algorithms / nFC5 algorithms / generalized forward checking algorithms / nFC0 algorithm / /

URL

www.csplib.org / /

SocialTag