News for hackers. Stuff that matters.

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

Re:LangPro: Natural Language Theorem Prover by tom_mellior on Friday September 01, 2017 @09:48AM (#15148272)
Prolog is a programming language, and this isn't a programming language. Prolog doesn't process natural language by itself. Prolog isn't a tableau-based theorem prover.

This project is a natural-language-processing, tableau-based-theorem-proving application implemented in the Prolog programming language.

[ Parent | on HN ]
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 ]