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

On 1/11/06, Bijan Parsia <bparsia@isr.umd.edu> wrote:
>
> Danny Ayers wrote:
> > 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]?
>
> Tableau reaosners are reasonably thought of as a constraints engine.
> Indeed, you'll see in the mid 90s literature that the completion graph
> is often referred too as a "constraint system".

Thanks Bijan, that hadn't occurred to me. Let me rephrase the question...

> A different questions is where existing constraint solvers solve
> certain problems very fast that have straightforward and simple OWL
> equivalents that existing reasoners don't handle that well. If you
> could show that equivalence, you could simply map the OWL to the
> constraints language, solve, and map the answers back. I suspect,
> however, that there many interesting cases.

...ok, that'll do - anyone tried it?

Cheers,
Danny.


--

http://dannyayers.com