COPLAS. Constraint Satisfaction Techniques for Planning and Scheduling Problems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10129965" target="_blank" >RIV/00216208:11320/12:10129965 - isvavai.cz</a>
Result on the web
<a href="http://icaps12.poli.usp.br/icaps12/workshops/coplas" target="_blank" >http://icaps12.poli.usp.br/icaps12/workshops/coplas</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
COPLAS. Constraint Satisfaction Techniques for Planning and Scheduling Problems
Original language description
The areas of AI planning and scheduling have seen important advances thanks to the application of constraint satisfaction models and techniques. Especially solutions to many real-world problems need to integrate plan synthesis capabilities with resourceallocation, which can be efficiently managed by using constraint satisfaction techniques. The workshop will aim at providing a forum for researchers in the field of Artificial Intelligence to discuss novel issues on planning, scheduling, constraint programming/constraint satisfaction problems (CSPs) and many other common areas that exist among them. On the whole, the workshop will mainly focus on managing complex problems where planning, scheduling and constraint satisfaction must be combined and/or interrelated, which entails an enormous potential for practical applications and future research.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)