Search results

Page title matches

• Lessons/Succeed, fail and backtrack - part 1
  ...<vp>runGoal()</vp>, which has three clauses. We will first create a '''''backtrack''''' point to the two other clauses, and then excecute the first clause. ...ted and follow the alternative way we noted in the backtrack point. (That backtrack point is then used and thus discarded).
  8 KB (1,472 words) - 12:50, 5 February 2020
• Lessons/Succeed, fail and backtrack - part 2
  In {{Lesson|Succeed, fail and backtrack - part 1}} we described what is means that a predcate succed and fail and w When <vp>run</vp> call <vp>runGoal</vp> we first create a backtrack point to thesecond <vp>runGoal</vp> clause and then execute the first claus
  6 KB (1,100 words) - 16:39, 27 September 2018
• Lessons/Succeed, fail and backtrack - part 3
  ...ledge in our little "knowledge base" (i.e. from {{lesson|Succeed, fail and backtrack - part 2}}). ...uments. Therefore it will succeed for the first clause and have created a backtrack point to the second clause. And so forth.
  5 KB (820 words) - 11:16, 4 September 2023

Page text matches

• Lessons/Succeed, fail and backtrack - part 2
  In {{Lesson|Succeed, fail and backtrack - part 1}} we described what is means that a predcate succed and fail and w When <vp>run</vp> call <vp>runGoal</vp> we first create a backtrack point to thesecond <vp>runGoal</vp> clause and then execute the first claus
  6 KB (1,100 words) - 16:39, 27 September 2018
• Lessons/Succeed, fail and backtrack - part 3
  ...ledge in our little "knowledge base" (i.e. from {{lesson|Succeed, fail and backtrack - part 2}}). ...uments. Therefore it will succeed for the first clause and have created a backtrack point to the second clause. And so forth.
  5 KB (820 words) - 11:16, 4 September 2023
• Lessons/Succeed, fail and backtrack - part 1
  ...<vp>runGoal()</vp>, which has three clauses. We will first create a '''''backtrack''''' point to the two other clauses, and then excecute the first clause. ...ted and follow the alternative way we noted in the backtrack point. (That backtrack point is then used and thus discarded).
  8 KB (1,472 words) - 12:50, 5 February 2020
• Language Reference/Terms/Try-catch-finally
  The <vpbnf><Term></vpbnf> and the handlers are not allowed to leave backtrack points (i.e. they cannot have mode <vp>multi</vp> or <vp>nondeterm</vp>). ...hether it succeeds, fails or terminates with an exception (it cannot leave backtrack points).
  4 KB (613 words) - 11:39, 12 February 2013
• Memory Management
  ...stack frame is '''not''' removed, when a predicate returns with an active backtrack point. ...e is also kept if the backtrack point occurs in a nested call. So a single backtrack point can keep a complete "chain" of stack frames alive.
  10 KB (1,784 words) - 11:57, 4 March 2016
• Fundamental Prolog Part 1
  During the execution of a program a lot of alternative choices (known as '''''backtrack points''''') might exist from earlier predicate calls. If some predicate call fails, then we will backtrack to the last backtrack point we met and try the alternative solution instead.
  25 KB (4,303 words) - 17:46, 18 September 2013
• How To Remove Reference Domains from a Project
  *setTerm is left with a backtrack point to the second clause of setTerm *we meet fail and therefore backtrack to the second clause of setTerm
  9 KB (1,476 words) - 12:29, 4 March 2016
• Language Reference/Clauses
  ...e relevant clauses in a predicate left, the program control can later '''''backtrack''''' to the clauses of this predicate to search for other solutions.
  2 KB (359 words) - 10:47, 26 October 2012
• Language Reference/Terms
  ...''''fails'''''), then the program will '''''backtrack''''' to the recorded backtrack point. Thereby restoring the program state and pursuing the other choice. T ...n turn calls <vp>qqq</vp>. When <vp>qqq</vp> is called, it first creates a backtrack point pointing to the second clause. Then the first clause is executed. Her
  42 KB (6,780 words) - 21:18, 19 February 2023
• Language Reference/Suspending Predicates
  * Backtrack Points: Backtrack points and trap points for suspending predicates are stored in the heap rat ...n the chain, and restores the state based on the information stored in the backtrack point.
  27 KB (3,970 words) - 14:58, 16 April 2024
• Ide/Debugger/Debugger Views
  ...k_up.png]]. It describes ordinary executable clauses, which do not produce backtrack points and are not trapped. ...occurs. Such items occur when a clause of a predicate, which creates a '''backtrack''' point (can produce more than one solution) is called.
  28 KB (4,251 words) - 17:25, 18 March 2015
• Visual Prolog 7.3 New Features
  * Condition of foreach statement which has no backtrack point (i.e. mode is not <vp>multi</vp> or <vp>nondeterm</vp>)
  8 KB (1,045 words) - 12:57, 14 May 2018
• Ide/Environment Overview
  The run stack not only shows the calls, it also shows trap points and backtrack points, these is described in a later tutorial and there I also describe th
  14 KB (2,309 words) - 15:11, 6 January 2020
• Language Reference/Predicates
  ...oint'' is in the set it means that the predicate can return with an active backtrack point in it.
  27 KB (4,014 words) - 14:02, 11 January 2024
• Compound and List Domains
  ...eing processed was not born in the current month), Visual Prolog begins to backtrack to look for another solution to the problem.
  25 KB (3,648 words) - 16:17, 14 February 2023
• Fundamental Visual Prolog
  ...r is called ''backtracking'', because the Prolog engine literally seems to backtrack over code which had earlier executed.
  26 KB (4,224 words) - 16:26, 6 October 2021