News for hackers. Stuff that matters.

A comment on LangPro: Natural Language Theorem Prover. Parent comment

Re:LangPro: Natural Language Theorem Prover by nurettin on Saturday September 02, 2017 @12:19AM (#15154234)
I mean how does the pruning constraint tree search applied in prolog implementations differ from the tableaux method
[ Parent | on HN ]
Re:LangPro: Natural Language Theorem Prover by nurettin on Saturday September 02, 2017 @01:39AM (#15154501)
After some research, the tableaux method seems to require full coverage, which would only converge with the search tree if all conditions have to be exhausted.
[ Parent | on HN ]