I don't understand (the point of) your example. In all branches of the search `X > 5` will never be `true` so yeah `slow_computation` will not be reached. How does that relate to your point of it being "brute force"
>> but if it did, it would come up with the same result
Meaning either changing the condition or the order of the clauses. How do you expect Prolog to proceed to `slow_computation` when you have declared a statement (X > 5) that is always false before it.
How does Scallop scale on large knowledge bases (KBs) for doing probabilistic reasoning? I'm currently working on large KB with ~ 12M facts and trying to do probabilistic inference on it. So far I've been using [cplint](https://friguzzi.github.io/cplint/_build/html/index.html) which is based on SWI-Prolog. It works fine for toy examples, however, it doesn't finish running for the large KB - even after waiting for it for more than a week. Does know any Probabilistic Logic Programming (PLP) libraries that are fast and scale to large KBs? Preferably in Prolog ecosystem, but not a hard requirement.
IM are legendary! I still listen to them now and then. My favorite tracks from them are - 'Deeply Disturbed', 'Becoming Insane' and 'Where do I belong'. Not exactly the same, but checkout Astrix and Neelix if you haven't already.
This is an interesting anecdote. I have gotten high several times during my college years and less so since I started my career. In all of the cases I got high, it was primarily for entertainment purposes. However, whenever I am high, I get some sense of clarity about problems that were irking me the week before (I usually do weed over the weekends). This led me to wonder, esp. lately, what if there is actually some connection between productivity and marijuana use (not abuse) and your experience seems to be inline with that. Ofcourse, there are trove of other anecdotes about how weed is used for creative/artistic purposes but I haven't come across ones related to programming.
>> but if it did, it would come up with the same result
Meaning either changing the condition or the order of the clauses. How do you expect Prolog to proceed to `slow_computation` when you have declared a statement (X > 5) that is always false before it.