Article View: comp.lang.prolog
Article #448non-sequential recursion
From: Eric Iverson
Date: Mon, 30 Oct 1989 21:53
Date: Mon, 30 Oct 1989 21:53
10 lines
783 bytes
783 bytes
This may be a baby problem, but here goes: Is there any possible way to skip levels while backtracking? By this I mean that if I run into a problem at level 4 and realize that level 2 is causing the problem, is there anyway that I can go directly to level 2 without having level 3 exhaustively fail first? I have some ideas of how to solve the problem, but am interested in other peoples opinions. -Eric Iverson
Technical Details
Message-ID:
<EIVERSON.89Oct30145311@hades.nmsu.edu>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!cmcl2!lanl!opus!eiversonShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!cmcl2!lanl!opus!eiverson From: eiverson@nmsu.edu (Eric Iverson) Newsgroups: comp.lang.prolog Subject: non-sequential recursion Message-ID: <EIVERSON.89Oct30145311@hades.nmsu.edu> Date: 30 Oct 89 21:53:11 GMT Sender: news@nmsu.edu Distribution: comp Organization: NMSU Computer Science Lines: 10