4 ms·
I don't see it. All the examples in this thread are trivial. I looked up the paper. All it does is answer trivial logic puzzles. penguin(pingu). bird(X):-peng
by isaacfrond 4y ago
I don't see it. All the examples in this thread are trivial. I looked up the paper. All it does is answer trivial logic puzzles.
penguin(pingu).
bird(X):-penguin(X).
that kind of thing. I downloaded the examples.zip from the website. It is a long list of undocumented examples. I sampled a few, but they are all of this nature. So I guess my question is:
Why is this impressive?
- sirwhinesalot 4y agoIt scales to much bigger problems, that's the impressive part. You can solve a small SAT problem with simple backtracking search, but try to solve a problem with millions of variables and tens of millions of constraints and suddenly your backtracking search is laughably slow. This is like that but at a higher level of expressivity. Having both classical negation and negation as failure allows for easy modelling of uncertainty for example. We don't know if P=NP but with how efficient these tools are in practice, maybe it doesn't matter that much x)