Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Yes, I see, that doesn't make sense.

I wonder if all that was more of a consideration in an older time, with weaker hardware. Anyway where I come from (ILP research, again) "polynomial time" is synonymous to "efficient" and the bigger problem is proofs failing to terminate.

I might actually try some learning experiments with the occurs check flag set to "true" just to see what happens. I mean, I wonder. I'm so used to leaving the flag to default false that I wonder if I haven't formed a completely wrong model about the execution of Prolog programs. I've been coding in Prolog for more than ten years now and it still catches me off-guard at times.



Consider to set the flag to "error" to see if there are any cases where infinite terms would be created.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: