ICTAI 2017 29th International Conference on Tools with Artificial Intelligence
Sprache des Titels:
Constraint Programming (CP) and Boolean Satisfiability (SAT) are two related major topics of research in Artificial Intelligence. They have proved to be the most efficient techniques at the heart of general-purpose combinatorial problem solving, with application ranging from automation of logics, verification, planning and scheduling, both in academic research and industry.
Over the years, the ICTAI conference has become a major forum for the CSP and SAT research communities for presenting new high-quality results. The special track SAT/CSP@ICTAI2017 is intended to be a forum for new ideas and techniques using satisfiability and constraint solving. It particularly welcomes new core solving techniques, extensions to other domains of AI and applications.