Constraint Modelling: A Challenge for First Order Automated Reasoning

Peter Baumgartner, John Slaney
2009 International Workshops on First Order Theorem Proving  
Cadoli et al [BCM04, MC05, CM04] noted the potential of first order automated reasoning for the purpose of analysing constraint models, and reported some encouraging initial experimental results. We are currently pursuing a very similar research program with a view to incorporating deductive technology in a state of the art constraint programming platform. Here we outline our own view of this application direction and discuss new empirical findings on a more extensive range of problems than
more » ... e considered in the previous literature. While the opportunities presented by reasoning about constraint models are indeed exciting, we also find that there are formidable obstacles in the way of a practically useful implementation. ⋆ NICTA is funded by the Australian Government's Backing Australia's Ability initiative. 1 See http://nicta.com.au/research/projects/constraint programming platform. We have benefited greatly from being in a team that has included Michael Norrish, Rajeev Gore, Jeremy Dawson, Jia Meng, Anbulagan and Jinbo Huang, and from the presence in the same laboratory of an AI team including Phil Kilby, Jussi Rintanen, Sylvie Thiébaux and others. The G12 project involves well over 20 researchers, including
dblp:conf/ftp/BaumgartnerS09 fatcat:tayozrojdzfmbkbj73jc2dt66q