Dubbed a ‘lazy’ problem solver, the software platform – which this week won the inaugural Google Australia Eureka Prize for Innovation in Computer Science – creates an effective way for finding the best solution to any problem with numerous possible outcomes. Professor Stuckey says there are two main approaches to solving such problems; constraint programming, and satisfiability programming. The basic premise behind Professor Stuckey’s development is to combine the two approaches; so as to make up for the shortcomings in each.lazy

“The problem with constraint solving systems is that they are bad at learning from mistakes made during the search process. On the other hand, satisfiability solvers are very effective at learning from mistakes. The trick is to pass on the inferences made by the constraint program to the satisfiability program, which can then learn automatically,” he says.
“The challenge is to find the right balance between telling the satisfiability program ‘too much' or ‘too little'.”

The $10,000 Eureka Prize for Innovation in Computer Science is awarded to a team or individual for an innovation in computer science that has the potential to improve the lives of many Australians. It is sponsored by Google Australia.