Subject: Subject Sylbus: Constraint Systems - 096228

Constraint Systems - 096228
Will not be given the year
Credit
Points
2.5
 
  Lecture Exercise Laboratory Project or
Seminar
House
Work
Weekly
Hours
2 1      

Determination of the grade according to progress during the semester and a final examination.


Prerequisites: ( Algorithms 1 234247
and Logic and Set Theory for Cs 234293 )


The Constraint Satisfaction Problem (Csp) Over Finite Domains, from Foamalization of Real Problems as Constraints Systems to Solving Them with Advanced Algorithms. the Sat Problem (Satisfiability of Boolean Formulas), as a Special Case of Csp. Csp and Sat Are Widely Used in a.I., Formal Verification, Logistics, Scheduling and More. Published.




Textbooks
PublishedPublisherAuthorsBook
2003morgan-kaufmann publishersr. dechterconstraint processing

Created in 08/03/2021 Time 14:31:51