Constraint programming and Boolean satisfiability for artificial intelligence
Project goals
The aim of the project is to improve constraint programming and Boolean satisfaction techniques to provide more efficiency in solving problems motivated by artificial intelligence. The project assumes to use tasks from automated planning (a sub-area of artificial intelligence) as a source of difficult problems to drive the improvements of constraint programming and Boolean satisfiability. The project is targeted on studying several particular questions, namely: (i) How to apply network flows for relaxing hard problems arising in constraint programming and Boolean satisfiability? (ii) How to exploit structural properties of problems arising in constraint programming and Boolean satisfiability for developing new types of consistencies? (iii) How does thestructure of highly parallel planning problems look like? (iv) What is the characterization of easy and difficult problems in relation to questions (i), (ii), and (iii)?
Keywords
CSPSATumělá inteligencetoky v sítíchkonzistencestrukturální vlastnosti
Public support
Provider
Czech Science Foundation
Programme
Post-graduate (doctorate) grants
Call for proposals
Postdoktorandské granty 9 (SGA02009GA1PD)
Main participants
—
Contest type
VS - Public tender
Contract ID
201/09/P318
Alternative language
Project name in Czech
Omezující podmínky a booleovská splnitelnost pro umělou inteligenci
Annotation in Czech
(i) Aplikovat toky v sítích pro relaxaci těžkých problémů z umělé inteligence. (ii) Navrhnout konzistenční techniky založené na strukturálních vlastnostech. (iii) Popsat strukturu vysoce paralelního plánování. (iv) Charakterizovat obtížnost problémů s využitím (i), (ii) a (iii).
Scientific branches
R&D category
ZV - Basic research
CEP classification - main branch
IN - Informatics
CEP - secondary branch
BA - General mathematics
CEP - another secondary branch
JD - Use of computers, robotics and its application
10101 - Pure mathematics
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
20204 - Robotics and automatic control
20205 - Automation and control systems
Completed project evaluation
Provider evaluation
U - Uspěl podle zadání (s publikovanými či patentovanými výsledky atd.)
Project results evaluation
The project gone according to plan both in terms of expertise and in terms of disbursement of funds.
Solution timeline
Realization period - beginning
Jan 1, 2009
Realization period - end
Dec 31, 2011
Project status
U - Finished project
Latest support payment
Apr 16, 2011
Data delivery to CEP
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data delivery code
CEP12-GA0-GP-U/03:3
Data delivery date
May 2, 2016
Finance
Total approved costs
882 thou. CZK
Public financial support
882 thou. CZK
Other public sources
0 thou. CZK
Non public and foreign sources
0 thou. CZK
Recognised costs
882 CZK thou.
Public support
882 CZK thou.
0%
Provider
Czech Science Foundation
CEP
IN - Informatics
Solution period
01. 01. 2009 - 31. 12. 2011