<--- Back to Details
First PageDocument Content
Artificial intelligence / Local consistency / Constraint satisfaction problem / Backjumping / Constraint satisfaction / Constraint optimization / Look-ahead / Backmarking / Backtracking / Constraint programming / Software engineering / Computer programming
Date: 2005-09-20 00:13:36
Artificial intelligence
Local consistency
Constraint satisfaction problem
Backjumping
Constraint satisfaction
Constraint optimization
Look-ahead
Backmarking
Backtracking
Constraint programming
Software engineering
Computer programming

Microsoft PowerPoint - CP school 2005 Pro tisk

Add to Reading List

Source URL: ktiml.mff.cuni.cz

Download Document from Source Website

File Size: 1,48 MB

Share Document on Facebook

Similar Documents

in Knowledge Engineering Reviews, 2001  Synthesis of EÆcient Constraint Satisfaction Programs Stephen J. Westfold and Douglas R. Smith Kestrel Institute 3260 Hillview Avenue

in Knowledge Engineering Reviews, 2001 Synthesis of EÆcient Constraint Satisfaction Programs Stephen J. Westfold and Douglas R. Smith Kestrel Institute 3260 Hillview Avenue

DocID: 1xVgq - View Document

Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems∗ Eli Ben-Sasson† Alessandro Chiesa†

Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems∗ Eli Ben-Sasson† Alessandro Chiesa†

DocID: 1xTDp - View Document

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

DocID: 1uD4W - View Document

1  Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

DocID: 1ukgD - View Document

5  CONSTRAINT SATISFACTION PROBLEMS  In which we see how treating states as more than just little black boxes leads to the

5 CONSTRAINT SATISFACTION PROBLEMS In which we see how treating states as more than just little black boxes leads to the

DocID: 1uf9a - View Document