Valued constraint satisfaction problems : hard and easy problems | Zendy

Thomas Schiex | Zendy; Hélène Fargier | Zendy; Gérard Verfaillie | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Valued constraint satisfaction problems : hard and easy problems

Author(s) -

Thomas Schiex,

Hélène Fargier,

Gérard Verfaillie

Publication year - 1995

Publication title -

hal (le centre pour la communication scientifique directe)

Language(s) - English

Resource type - Conference proceedings

Subject(s) - constraint satisfaction problem , constraint satisfaction , constraint (computer aided design) , extension (predicate logic) , computer science , simple (philosophy) , rationality , mathematical optimization , constraint satisfaction dual problem , operator (biology) , aggregate (composite) , computational complexity theory , local consistency , theoretical computer science , mathematics , algorithm , artificial intelligence , programming language , probabilistic logic , philosophy , materials science , repressor , law , chemistry , composite material , biochemistry , epistemology , political science , transcription factor , gene , geometry

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research