Re: SUO: RE: Problems in SUMO
Chris,
Yes, we all know that:
>Except consistency in propositional logic is intractable; it isn't even
>so much as decidable in predicate logic. You are asking for the
>impossible, John.
But it is also true that there are very large numbers of very tractable problems,
such as Ian`s examples of the round square or colorless green ideas, which can
be
tested in milliseconds. And the TPTP (thousands of problems for theorem provers)
cover a very wide range of useful and interesting stuff.
There are simple, rapid syntactic tests for a program to determine whether a
particular
problem is simple or problematical. And it can say so before getting hung up
in a loop.
John