Pedro Fanha

That is exactly the one I'm using. I just scrapped all the user mode code and wrote my own to avoid a DLL dependency and because I already had code...

No, it uses a kernel driver. There is a kernel mode and user mode to it: the DLL, which applications load and call functions from, and the kernel mode (the...

Yes, I know, but I want to figure out why it doesn't work at all now. I followed all the main calls in Mystic Light and I don't seem to...

Yes, but I mean there are multiple DLLs. The DLL I've been looking at had all the logic for dealing with the chip, but maybe there's something else. Or I'm...

The DLLs DO matter, because that's where I get the information from. I'm reverse engineering them, not doing trial and error with RWeverything. Also, no, you can't. Especially not a...

I think you don't understand what I'm saying. I'm NOT doing trial and error with RWeverything. That can tell me what is happening, but not how and why. I'm reverse...

http://www.cogsci.rpi.edu/~heuveb/teaching/Logic/CompLogic/Web/Handouts/FO-Completeness-Truth-Tree.pdf Following this, I can guarantee that if the algorithm generates an infinite tree, then the initial set of statements is satisfiable. I.e. there's no way for the algorithm to...

A possibility to work around infinite trees is providing an option to stop the algorithm as soon as it is clear that a set of statements is satisfiable (i.e. as...

A better idea is to implement a callback on every iteration of the loop of the truth tree algorithm so that a human can check the progress in real time...

The idea just above would put some burden on the user to verify the validity of the result. An alternative, which still has this issue to but to a lesser...