- From: Danny Ayers <danny.ayers@gmail.com>
- Date: Tue, 10 Jan 2006 16:08:02 +0100
- To: Aditya Kalyanpur <swap_adityak@yahoo.com>
- Cc: Jeremy Wong ¶Àªl¶q <jeremy@1980.hk>, Semantic Web <semantic-web@w3.org>
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
Received on Tuesday, 10 January 2006 15:10:25 UTC