Constraint-based inference? (was Re: Solving Sudoku with OWL)

The Sudoku thread reminds me of a question (prompted by a comment from
Tim Finin [1]) - has anyone tried doing any RDFS/OWL inference based
on a constraints programming engine [2]?

For highly combinative problems (like Sudoku) perhaps such a setup may
give improved performance (maybe a hybrid might be feasible - e.g. the
constraints part sorting out the AllDifferent kind of inferences, then
passing the partial results to a complete DL reasoner to finish up..?)

Cheers,
Danny.

[1] http://dannyayers.com/?s=sudoku&submit=Search+Archives
[2] http://en.wikipedia.org/wiki/Constraint_programming


--

http://dannyayers.com