Visual Prolog:最大流数 [英] Visual Prolog: Maximum number of anyflow

问题描述

尝试执行此代码时收到错误消息Maximum number of anyflow variants (1000) exceeded:

I get an error message Maximum number of anyflow variants (1000) exceeded when trying to execute this code:

findNegative([], []).
findNegative([Q|V], Y) :-
   Q > 0,
   !,
   findNegative(V, Y).
findNegative([H1|T1], S) :-
   findNegative(T1, [H1|S]).

与尝试从以下答案中执行代码时相同: https://stackoverflow.com/a/6671142/4829408

Same when trying to execute code from this answer: https://stackoverflow.com/a/6671142/4829408

推荐答案

请考虑以下代码:

find_negatives([],        [] ).
find_negatives([E|Es],    Xs ) :- E >= 0, find_negatives(Es, Xs).
find_negatives([E|Es], [E|Xs]) :- E <  0, find_negatives(Es, Xs).

示例查询:

?- find_negatives([1,2,3,-1,-2,-3,0,1,2,0,-1], Xs).
   Xs = [-1,-2,-3,-1]
;  false.

这篇关于Visual Prolog:最大流数的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！