First Page | Document Content | |
---|---|---|
Date: 2014-02-17 03:08:57Constraint satisfaction Computing Mathematical optimization Polynomial Constraint Constraint logic programming Constraint programming Software engineering Computer programming | Super Solutions Emmanuel Hebrard Toulouse OutlineAdd to Reading ListSource URL: homepages.laas.frDownload Document from Source WebsiteFile Size: 2,00 MBShare Document on Facebook |
Theory and Practice of Logic Programming, Vol. 6, No. 5, pp, Programming Finite-Domain Constraint Propagators in Action RulesDocID: 1tOef - View Document | |
Proceedings of CICLOPS 2009 9th International Colloquium on Implementation of Constraint and LOgic Programming SystemsDocID: 1t8iI - View Document | |
On the Robustness of Qualitative Distance- and Direction-Reasoning* Jung-Hong Hong Department of Surveying Engineering National Cheng-Kung UniversityDocID: 1rqXQ - View Document | |
CONTRIBUTED TALK ABSTRACTS 1.2 JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent develDocID: 1rm3f - View Document | |
AAAI Proceedings TemplateDocID: 1r9Ui - View Document |