- html - 出于某种原因,IE8 对我的 Sass 文件中继承的 html5 CSS 不友好?
- JMeter 在响应断言中使用 span 标签的问题
- html - 在 :hover and :active? 上具有不同效果的 CSS 动画
- html - 相对于居中的 html 内容固定的 CSS 重复背景?
这是类作业,但我不知道如何解决我的问题。我写了以下内容:
sentence(S0, S):- f(S0,S); t(S0, S1),n(S1, S2),t(S2, S).
f(S0, S):- termIf(S0, S1), pLeft(S1, S2), b(S2, S3), pRight(S3, S4), termThen(S4, S5), termBegin(S5, S6),sentence(S6, S7), termEnd(S7, S); termIf(S0, S1), pLeft(S1, S2), b(S2, S3), pRight(S3, S4), termThen(S4, S5),termBegin(S5, S6),sentence(S6, S7), termElse(S7, S8), sentence(S8, S9), termEnd(S9, S).
b(S0, S):- t(S0, S1), e(S1, S2), t(S2, S).
termIf(S0, S) :- S0=[if|S].
termThen(S0, S):- S0=[then|S].
termBegin(S0, S):- S0=[begin|S].
termEnd(S0, S):- S0=[end|S].
termElse(S0, S):- S0=[else|S].
pLeft(S0, S):- S0=['('|S].
pRight(S0, S):- S0=[')'|S].
t(S0, S):- S0=[x|S].
t(S0, S):- S0=[y|S].
t(S0, S):- S0=[z|S].
t(S0, S):- S0=[1|S].
t(S0, S):- S0=[0|S].
e(S0, S):- S0=[>|S].
e(S0, S):- S0=[<|S].
n(S0, S):- S0=[+|S].
n(S0, S):- S0=[-|S].
n(S0, S):- S0=[=|S].
我做了一个跟踪:
[trace] [5] ?- sentence([if,'(', x, >, 0,')', then, begin, [x, =, 1], end], X).
Call: (89) sentence([if, '(', x, >, 0, ')', then, begin|...], _66584) ? creep
Call: (90) f([if, '(', x, >, 0, ')', then, begin|...], _66584) ? creep
Call: (91) termIf([if, '(', x, >, 0, ')', then, begin|...], _67166) ? creep
Call: (92) [if, '(', x, >, 0, ')', then, begin|...]=[if|_67158] ? creep
Exit: (92) [if, '(', x, >, 0, ')', then, begin|...]=[if, '(', x, >, 0, ')', then, begin|...] ? creep
Exit: (91) termIf([if, '(', x, >, 0, ')', then, begin|...], ['(', x, >, 0, ')', then, begin, [...|...]|...]) ? creep
Call: (91) pLeft(['(', x, >, 0, ')', then, begin, [...|...]|...], _67348) ? creep
Call: (92) ['(', x, >, 0, ')', then, begin, [...|...]|...]=['('|_67340] ? creep
Exit: (92) ['(', x, >, 0, ')', then, begin, [...|...]|...]=['(', x, >, 0, ')', then, begin, [...|...]|...] ? creep
Exit: (91) pLeft(['(', x, >, 0, ')', then, begin, [...|...]|...], [x, >, 0, ')', then, begin, [x|...], end]) ? creep
Call: (91) b([x, >, 0, ')', then, begin, [x|...], end], _67530) ? creep
Call: (92) t([x, >, 0, ')', then, begin, [x|...], end], _67574) ? creep
Call: (93) [x, >, 0, ')', then, begin, [x|...], end]=[x|_67566] ? creep
Exit: (93) [x, >, 0, ')', then, begin, [x|...], end]=[x, >, 0, ')', then, begin, [x|...], end] ? creep
Exit: (92) t([x, >, 0, ')', then, begin, [x|...], end], [>, 0, ')', then, begin, [x, =|...], end]) ? creep
Call: (92) e([>, 0, ')', then, begin, [x, =|...], end], _67756) ? creep
Call: (93) [>, 0, ')', then, begin, [x, =|...], end]=[>|_67748] ? creep
Exit: (93) [>, 0, ')', then, begin, [x, =|...], end]=[>, 0, ')', then, begin, [x, =|...], end] ? creep
Exit: (92) e([>, 0, ')', then, begin, [x, =|...], end], [0, ')', then, begin, [x, =, 1], end]) ? creep
Call: (92) t([0, ')', then, begin, [x, =, 1], end], _67938) ? creep
Call: (93) [0, ')', then, begin, [x, =, 1], end]=[x|_67930] ? creep
Fail: (93) [0, ')', then, begin, [x, =, 1], end]=[x|_67930] ? creep
Redo: (92) t([0, ')', then, begin, [x, =, 1], end], _68076) ? creep
Call: (93) [0, ')', then, begin, [x, =, 1], end]=[y|_68068] ? creep
Fail: (93) [0, ')', then, begin, [x, =, 1], end]=[y|_68068] ? creep
Redo: (92) t([0, ')', then, begin, [x, =, 1], end], _68214) ? creep
Call: (93) [0, ')', then, begin, [x, =, 1], end]=[z|_68206] ? creep
Fail: (93) [0, ')', then, begin, [x, =, 1], end]=[z|_68206] ? creep
Redo: (92) t([0, ')', then, begin, [x, =, 1], end], _68352) ? creep
Call: (93) [0, ')', then, begin, [x, =, 1], end]=[1|_68344] ? creep
Fail: (93) [0, ')', then, begin, [x, =, 1], end]=[1|_68344] ? creep
Redo: (92) t([0, ')', then, begin, [x, =, 1], end], _68490) ? creep
Call: (93) [0, ')', then, begin, [x, =, 1], end]=[0|_68482] ? creep
Exit: (93) [0, ')', then, begin, [x, =, 1], end]=[0, ')', then, begin, [x, =, 1], end] ? creep
Exit: (92) t([0, ')', then, begin, [x, =, 1], end], [')', then, begin, [x, =, 1], end]) ? creep
Exit: (91) b([x, >, 0, ')', then, begin, [x|...], end], [')', then, begin, [x, =, 1], end]) ? creep
Call: (91) pRight([')', then, begin, [x, =, 1], end], _68716) ? creep
Call: (92) [')', then, begin, [x, =, 1], end]=[')'|_68708] ? creep
Exit: (92) [')', then, begin, [x, =, 1], end]=[')', then, begin, [x, =, 1], end] ? creep
Exit: (91) pRight([')', then, begin, [x, =, 1], end], [then, begin, [x, =, 1], end]) ? creep
Call: (91) termThen([then, begin, [x, =, 1], end], _68898) ? creep
Call: (92) [then, begin, [x, =, 1], end]=[then|_68890] ? creep
Exit: (92) [then, begin, [x, =, 1], end]=[then, begin, [x, =, 1], end] ? creep
Exit: (91) termThen([then, begin, [x, =, 1], end], [begin, [x, =, 1], end]) ? creep
Call: (91) termBegin([begin, [x, =, 1], end], _69080) ? creep
Call: (92) [begin, [x, =, 1], end]=[begin|_69072] ? creep
Exit: (92) [begin, [x, =, 1], end]=[begin, [x, =, 1], end] ? creep
Exit: (91) termBegin([begin, [x, =, 1], end], [[x, =, 1], end]) ? creep
Call: (91) sentence([[x, =, 1], end], _69262) ? creep
Call: (92) f([[x, =, 1], end], _69306) ? creep
Call: (93) termIf([[x, =, 1], end], _69350) ? creep
Call: (94) [[x, =, 1], end]=[if|_69342] ? creep
Fail: (94) [[x, =, 1], end]=[if|_69342] ? creep
Fail: (93) termIf([[x, =, 1], end], _69488) ? creep
Redo: (92) f([[x, =, 1], end], _69532) ? creep
Call: (93) termIf([[x, =, 1], end], _69576) ? creep
Call: (94) [[x, =, 1], end]=[if|_69568] ? creep
Fail: (94) [[x, =, 1], end]=[if|_69568] ? creep
Fail: (93) termIf([[x, =, 1], end], _69714) ? creep
Fail: (92) f([[x, =, 1], end], _69758) ? creep
Redo: (91) sentence([[x, =, 1], end], _69802) ? creep
Call: (92) t([[x, =, 1], end], _69846) ? creep
Call: (93) [[x, =, 1], end]=[x|_69838] ? creep
Fail: (93) [[x, =, 1], end]=[x|_69838] ? creep
Redo: (92) t([[x, =, 1], end], _69984) ? creep
Call: (93) [[x, =, 1], end]=[y|_69976] ? creep
Fail: (93) [[x, =, 1], end]=[y|_69976] ? creep
Redo: (92) t([[x, =, 1], end], _70122) ? creep
Call: (93) [[x, =, 1], end]=[z|_70114] ? creep
Fail: (93) [[x, =, 1], end]=[z|_70114] ? creep
Redo: (92) t([[x, =, 1], end], _70260) ? creep
Call: (93) [[x, =, 1], end]=[1|_70252] ? creep
Fail: (93) [[x, =, 1], end]=[1|_70252] ? creep
Redo: (92) t([[x, =, 1], end], _70398) ? creep
Call: (93) [[x, =, 1], end]=[0|_70390] ? creep
Fail: (93) [[x, =, 1], end]=[0|_70390] ? creep
Fail: (92) t([[x, =, 1], end], _70536) ? creep
Fail: (91) sentence([[x, =, 1], end], _70580) ? creep
Redo: (92) e([>, 0, ')', then, begin, [x, =|...], end], _70624) ? creep
Call: (93) [>, 0, ')', then, begin, [x, =|...], end]=[<|_70616] ? creep
Fail: (93) [>, 0, ')', then, begin, [x, =|...], end]=[<|_70616] ? creep
Fail: (92) e([>, 0, ')', then, begin, [x, =|...], end], _70762) ? creep
Redo: (92) t([x, >, 0, ')', then, begin, [x|...], end], _70806) ? creep
Call: (93) [x, >, 0, ')', then, begin, [x|...], end]=[y|_70798] ? creep
Fail: (93) [x, >, 0, ')', then, begin, [x|...], end]=[y|_70798] ? creep
Redo: (92) t([x, >, 0, ')', then, begin, [x|...], end], _70944) ? creep
Call: (93) [x, >, 0, ')', then, begin, [x|...], end]=[z|_70936] ? creep
Fail: (93) [x, >, 0, ')', then, begin, [x|...], end]=[z|_70936] ? creep
Redo: (92) t([x, >, 0, ')', then, begin, [x|...], end], _71082) ? creep
Call: (93) [x, >, 0, ')', then, begin, [x|...], end]=[1|_71074] ? creep
Fail: (93) [x, >, 0, ')', then, begin, [x|...], end]=[1|_71074] ? creep
Redo: (92) t([x, >, 0, ')', then, begin, [x|...], end], _71220) ? creep
Call: (93) [x, >, 0, ')', then, begin, [x|...], end]=[0|_71212] ? creep
Fail: (93) [x, >, 0, ')', then, begin, [x|...], end]=[0|_71212] ? creep
Fail: (92) t([x, >, 0, ')', then, begin, [x|...], end], _71358) ? creep
Fail: (91) b([x, >, 0, ')', then, begin, [x|...], end], _71402) ? creep
Redo: (90) f([if, '(', x, >, 0, ')', then, begin|...], _66584) ? creep
Call: (91) termIf([if, '(', x, >, 0, ')', then, begin|...], _71490) ? creep
Call: (92) [if, '(', x, >, 0, ')', then, begin|...]=[if|_71482] ? creep
Exit: (92) [if, '(', x, >, 0, ')', then, begin|...]=[if, '(', x, >, 0, ')', then, begin|...] ? creep
Exit: (91) termIf([if, '(', x, >, 0, ')', then, begin|...], ['(', x, >, 0, ')', then, begin, [...|...]|...]) ? creep
Call: (91) pLeft(['(', x, >, 0, ')', then, begin, [...|...]|...], _71672) ? creep
Call: (92) ['(', x, >, 0, ')', then, begin, [...|...]|...]=['('|_71664] ? creep
Exit: (92) ['(', x, >, 0, ')', then, begin, [...|...]|...]=['(', x, >, 0, ')', then, begin, [...|...]|...] ? creep
Exit: (91) pLeft(['(', x, >, 0, ')', then, begin, [...|...]|...], [x, >, 0, ')', then, begin, [x|...], end]) ? creep
Call: (91) b([x, >, 0, ')', then, begin, [x|...], end], _71854) ? creep
Call: (92) t([x, >, 0, ')', then, begin, [x|...], end], _71898) ? creep
Call: (93) [x, >, 0, ')', then, begin, [x|...], end]=[x|_71890] ? creep
Exit: (93) [x, >, 0, ')', then, begin, [x|...], end]=[x, >, 0, ')', then, begin, [x|...], end] ? creep
Exit: (92) t([x, >, 0, ')', then, begin, [x|...], end], [>, 0, ')', then, begin, [x, =|...], end]) ? creep
Call: (92) e([>, 0, ')', then, begin, [x, =|...], end], _72080) ? creep
Call: (93) [>, 0, ')', then, begin, [x, =|...], end]=[>|_72072] ? creep
Exit: (93) [>, 0, ')', then, begin, [x, =|...], end]=[>, 0, ')', then, begin, [x, =|...], end] ? creep
Exit: (92) e([>, 0, ')', then, begin, [x, =|...], end], [0, ')', then, begin, [x, =, 1], end]) ? creep
Call: (92) t([0, ')', then, begin, [x, =, 1], end], _72262) ? creep
Call: (93) [0, ')', then, begin, [x, =, 1], end]=[x|_72254] ? creep
Fail: (93) [0, ')', then, begin, [x, =, 1], end]=[x|_72254] ? creep
Redo: (92) t([0, ')', then, begin, [x, =, 1], end], _72400) ? creep
Call: (93) [0, ')', then, begin, [x, =, 1], end]=[y|_72392] ? creep
Fail: (93) [0, ')', then, begin, [x, =, 1], end]=[y|_72392] ? creep
Redo: (92) t([0, ')', then, begin, [x, =, 1], end], _72538) ? creep
Call: (93) [0, ')', then, begin, [x, =, 1], end]=[z|_72530] ? creep
Fail: (93) [0, ')', then, begin, [x, =, 1], end]=[z|_72530] ? creep
Redo: (92) t([0, ')', then, begin, [x, =, 1], end], _72676) ? creep
Call: (93) [0, ')', then, begin, [x, =, 1], end]=[1|_72668] ? creep
Fail: (93) [0, ')', then, begin, [x, =, 1], end]=[1|_72668] ? creep
Redo: (92) t([0, ')', then, begin, [x, =, 1], end], _72814) ? creep
Call: (93) [0, ')', then, begin, [x, =, 1], end]=[0|_72806] ? creep
Exit: (93) [0, ')', then, begin, [x, =, 1], end]=[0, ')', then, begin, [x, =, 1], end] ? creep
Exit: (92) t([0, ')', then, begin, [x, =, 1], end], [')', then, begin, [x, =, 1], end]) ? creep
Exit: (91) b([x, >, 0, ')', then, begin, [x|...], end], [')', then, begin, [x, =, 1], end]) ? creep
Call: (91) pRight([')', then, begin, [x, =, 1], end], _73040) ? creep
Call: (92) [')', then, begin, [x, =, 1], end]=[')'|_73032] ? creep
Exit: (92) [')', then, begin, [x, =, 1], end]=[')', then, begin, [x, =, 1], end] ? creep
Exit: (91) pRight([')', then, begin, [x, =, 1], end], [then, begin, [x, =, 1], end]) ? creep
Call: (91) termThen([then, begin, [x, =, 1], end], _73222) ? creep
Call: (92) [then, begin, [x, =, 1], end]=[then|_73214] ? creep
Exit: (92) [then, begin, [x, =, 1], end]=[then, begin, [x, =, 1], end] ? creep
Exit: (91) termThen([then, begin, [x, =, 1], end], [begin, [x, =, 1], end]) ? creep
Call: (91) termBegin([begin, [x, =, 1], end], _73404) ? creep
Call: (92) [begin, [x, =, 1], end]=[begin|_73396] ? creep
Exit: (92) [begin, [x, =, 1], end]=[begin, [x, =, 1], end] ? creep
Exit: (91) termBegin([begin, [x, =, 1], end], [[x, =, 1], end]) ? creep
Call: (91) sentence([[x, =, 1], end], _73586) ? creep
Call: (92) f([[x, =, 1], end], _73630)
Ԁ Fail: (93) [0, ')', then, begin, [x, =, 1], end]=[1|_72668] ? creep
Redo: (92) t([0, ')', then, begin, [x, =, 1], end], _72814) ? creep
Call: (93) [0, ')', then, begin, [x, =, 1], end]=[0|_72806] ? creep
Exit: (93) [0, ')', then, begin, [x, =, 1], end]=[0, ')', then, begin, [x, =, 1], end] ? creep
Exit: (92) t([0, ')', then, begin, [x, =, 1], end], [')', then, begin, [x, =, 1], end]) ? creep
Exit: (91) b([x, >, 0, ')', then, begin, [x|...], end], [')', then, begin, [x, =, 1], end]) ? creep
Call: (91) pRight([')', then, begin, [x, =, 1], end], _73040) ? creep
Call: (92) [')', then, begin, [x, =, 1], end]=[')'|_73032] ? creep
Exit: (92) [')', then, begin, [x, =, 1], end]=[')', then, begin, [x, =, 1], end] ? creep
Exit: (91) pRight([')', then, begin, [x, =, 1], end], [then, begin, [x, =, 1], end]) ? creep
Call: (91) termThen([then, begin, [x, =, 1], end], _73222) ? creep
Call: (92) [then, begin, [x, =, 1], end]=[then|_73214] ? creep
Exit: (92) [then, begin, [x, =, 1], end]=[then, begin, [x, =, 1], end] ? creep
Exit: (91) termThen([then, begin, [x, =, 1], end], [begin, [x, =, 1], end]) ? creep
Call: (91) termBegin([begin, [x, =, 1], end], _73404) ? creep
Call: (92) [begin, [x, =, 1], end]=[begin|_73396] ? creep
Exit: (92) [begin, [x, =, 1], end]=[begin, [x, =, 1], end] ? creep
Exit: (91) termBegin([begin, [x, =, 1], end], [[x, =, 1], end]) ? creep
Call: (91) sentence([[x, =, 1], end], _73586) ? creep
Call: (92) f([[x, =, 1], end], _73630) ? creep
Call: (93) termIf([[x, =, 1], end], _73674) ? creep
Call: (94) [[x, =, 1], end]=[if|_73666] ? creep
Fail: (94) [[x, =, 1], end]=[if|_73666] ? creep
Fail: (93) termIf([[x, =, 1], end], _73812) ? creep
Redo: (92) f([[x, =, 1], end], _73856) ? creep
Call: (93) termIf([[x, =, 1], end], _73900) ? creep
Call: (94) [[x, =, 1], end]=[if|_73892] ? creep
Fail: (94) [[x, =, 1], end]=[if|_73892] ? creep
Fail: (93) termIf([[x, =, 1], end], _74038) ? creep
Fail: (92) f([[x, =, 1], end], _74082) ? creep
Redo: (91) sentence([[x, =, 1], end], _74126) ? creep
Call: (92) t([[x, =, 1], end], _74170) ? creep
Call: (93) [[x, =, 1], end]=[x|_74162] ? creep
Fail: (93) [[x, =, 1], end]=[x|_74162] ? creep
Redo: (92) t([[x, =, 1], end], _74308) ? creep
Call: (93) [[x, =, 1], end]=[y|_74300] ? creep
Fail: (93) [[x, =, 1], end]=[y|_74300] ? creep
Redo: (92) t([[x, =, 1], end], _74446) ? creep
Call: (93) [[x, =, 1], end]=[z|_74438] ? creep
Fail: (93) [[x, =, 1], end]=[z|_74438] ? creep
Redo: (92) t([[x, =, 1], end], _74584) ? creep
Call: (93) [[x, =, 1], end]=[1|_74576] ? creep
Fail: (93) [[x, =, 1], end]=[1|_74576] ? creep
Redo: (92) t([[x, =, 1], end], _74722) ? creep
Call: (93) [[x, =, 1], end]=[0|_74714] ? creep
Fail: (93) [[x, =, 1], end]=[0|_74714] ? creep
Fail: (92) t([[x, =, 1], end], _74860) ? creep
Fail: (91) sentence([[x, =, 1], end], _74904) ? creep
Redo: (92) e([>, 0, ')', then, begin, [x, =|...], end], _74948) ? creep
Call: (93) [>, 0, ')', then, begin, [x, =|...], end]=[<|_74940] ? creep
Fail: (93) [>, 0, ')', then, begin, [x, =|...], end]=[<|_74940] ? creep
Fail: (92) e([>, 0, ')', then, begin, [x, =|...], end], _75086) ? creep
Redo: (92) t([x, >, 0, ')', then, begin, [x|...], end], _75130) ? creep
Call: (93) [x, >, 0, ')', then, begin, [x|...], end]=[y|_75122] ? creep
Fail: (93) [x, >, 0, ')', then, begin, [x|...], end]=[y|_75122] ? creep
Redo: (92) t([x, >, 0, ')', then, begin, [x|...], end], _75268) ? creep
Call: (93) [x, >, 0, ')', then, begin, [x|...], end]=[z|_75260] ? creep
Fail: (93) [x, >, 0, ')', then, begin, [x|...], end]=[z|_75260] ? creep
Redo: (92) t([x, >, 0, ')', then, begin, [x|...], end], _75406) ? creep
Call: (93) [x, >, 0, ')', then, begin, [x|...], end]=[1|_75398] ? creep
Fail: (93) [x, >, 0, ')', then, begin, [x|...], end]=[1|_75398] ? creep
Redo: (92) t([x, >, 0, ')', then, begin, [x|...], end], _75544) ? creep
Call: (93) [x, >, 0, ')', then, begin, [x|...], end]=[0|_75536] ? creep
Fail: (93) [x, >, 0, ')', then, begin, [x|...], end]=[0|_75536] ? creep
Fail: (92) t([x, >, 0, ')', then, begin, [x|...], end], _75682) ? creep
Fail: (91) b([x, >, 0, ')', then, begin, [x|...], end], _75726) ? creep
Fail: (90) f([if, '(', x, >, 0, ')', then, begin|...], _66584) ? creep
Redo: (89) sentence([if, '(', x, >, 0, ')', then, begin|...], _66584) ? creep
Call: (90) t([if, '(', x, >, 0, ')', then, begin|...], _75858) ? creep
Call: (91) [if, '(', x, >, 0, ')', then, begin|...]=[x|_75850] ? creep
Fail: (91) [if, '(', x, >, 0, ')', then, begin|...]=[x|_75850] ? creep
Redo: (90) t([if, '(', x, >, 0, ')', then, begin|...], _75996) ? creep
Call: (91) [if, '(', x, >, 0, ')', then, begin|...]=[y|_75988] ? creep
Fail: (91) [if, '(', x, >, 0, ')', then, begin|...]=[y|_75988] ? creep
Redo: (90) t([if, '(', x, >, 0, ')', then, begin|...], _76134) ? creep
Call: (91) [if, '(', x, >, 0, ')', then, begin|...]=[z|_76126]
Fail: (91) [if, '(', x, >, 0, ')', then, begin|...]=[z|_76126] ? creep
Redo: (90) t([if, '(', x, >, 0, ')', then, begin|...], _76272) ? creep
Call: (91) [if, '(', x, >, 0, ')', then, begin|...]=[1|_76264] ? creep
Fail: (91) [if, '(', x, >, 0, ')', then, begin|...]=[1|_76264] ? creep
Redo: (90) t([if, '(', x, >, 0, ')', then, begin|...], _76410) ? creep
Call: (91) [if, '(', x, >, 0, ')', then, begin|...]=[0|_76402] ? creep
Fail: (91) [if, '(', x, >, 0, ')', then, begin|...]=[0|_76402] ? creep
Fail: (90) t([if, '(', x, >, 0, ')', then, begin|...], _76548) ? creep
Fail: (89) sentence([if, '(', x, >, 0, ')', then, begin|...], _66584) ? creep
false
我认为在调用句子时它显然失败了,但它得到了一个它无法处理的 [[x, =, 1], end]。我认为显而易见的答案是 [x, =, 1] 是列表的第一个元素,但我不知道如何将该元素传递给句子,以便正确处理事情。我很困惑。
最佳答案
代码需要一个平面的终端列表,但你有一个嵌套的 [x,=,1]
。你想要的是
?- sentence([if, '(', x, >, 0, ')', then, begin, x, =, 1, end], X).
X = []
Yes (0.00s cpu, solution 1, maybe more)
No (0.00s cpu)
关于prolog - 在序言中编写语法并且无法使其正常工作,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/67185323/
我正在学习序言。 在我看来,prolog 的规则(关系和简单的事实)是“肯定的”——他们说的是或可能是真的。 向 prolog 程序添加新的此类规则只会增加“正面”知识。它不能添加“负面”事实来说明某
希望你一切都好。我是 prolog 的新手,我在编写代码时遇到问题。这段代码的目的很简单。它将列表中的每个元素添加到最后一个。我可以用 Java 做的事情是: static void add(
在closed-world assumption下, what is not currently known to be true, is false Prolog 的语义通常被称为遵循封闭世界假设,
我正在 Prolog (swi-prolog) 中做我的第一步,但无法解决以下问题:如何将存在量化的规则包含在我的事实中;具体来说,我如何包含句子“每个人都是某人的 friend ”\forall x
我知道如何以过程方式(即,在 C++、Java 等中)对 BST 执行范围查询,但我发现很难转换为 Prolog 语言。 程序的方式应该是这样的: http://www.geeksforgeeks.o
Prolog 中是否有(相对)当前最佳实践的引用资料?一本适合没有学习过逻辑编程或“Prolog 的工艺”等高级文本的商业 Prolog 开发人员? 有很多通用教程,但我能找到的关于最佳实践的唯一一个
这是CFG: S -> T | V T -> UU U -> aUb | ab V -> aVb | aWb W -> bWa | ba 所以这将接受某种形式的: {a^n b^n a^m b^m |
我目前有以下问题,我想用 Prolog 解决。这是一个简单的例子,很容易在 Java/C/whatever 中解决。我的问题是,我认为与 Java 的思想联系太紧密,无法以利用 Prolog 逻辑能力
就目前而言,这个问题不适合我们的问答形式。我们希望答案得到事实、引用资料或专业知识的支持,但这个问题可能会引发辩论、争论、投票或扩展讨论。如果您觉得这个问题可以改进并可能重新打开,visit the
我无法理解差异列表,尤其是在这个谓词中: palindrome(A, A). palindrome([_|A], A). palindrome([C|A], D) :- palindrome(A
(这不是一个类(class)作业问题。只是我自己的个人学习。) 我正在尝试在 Prolog 中进行练习以从列表中删除元素。这是我的代码: deleteall([],X,[]). deleteall([
我最近试图了解 Prolog,它似乎可以很好地映射到很多领域,但我无法弄清楚它可能不擅长什么。 那么它有什么不好的(除了需要实时/无 gc 性能的东西)? 最佳答案 我同意你的一般评估,即 Prolo
我正在组装一个简单的元解释器,它输出证明的步骤。我无法将证明步骤作为输出参数。我的谓词 explain1 以我想要的详细形式返回证明,但不是作为输出参数。我的谓词 explain2 将证明作为输出参数
hi(g,plus(A,B),int) :- hi(g,A,int),hi(g,B,int),!. 在上面的语句中 '!' 是什么意思?在声明的末尾签名吗? 最佳答案 那是 cut operator
有没有一种简单的方法可以让 prolog 中的查询只返回每个结果一次? 例如我正在尝试类似的东西: deadly(Xn) :- scary(X), Xn is X - 1, Xp is X + 1,
我正在尝试学习 Prolog。这是我使用这种语言的第一步。作为练习,我想编写可以识别一些扑克手牌的程序(同花顺、同花顺、满屋等)。 我正在 Prolog 中寻找良好的卡片表示。我需要有可能检查一张卡片
我刚刚被介绍到 Prolog 并且正在尝试编写一个谓词来查找整数列表的最大值。我需要写一个从头开始比较,另一个从结尾比较。到目前为止,我有: max2([],R). max2([X|Xs], R):-
我试图在Prolog中编写谓词palindrome/1,当且仅当其列表输入包含回文列表时才为true。 例如: ?- palindrome([1,2,3,4,5,4,3,2,1]). 是真的。 有什么
我正在尝试编写一个程序,该程序将两个列表作为输入并检查适当的子集。我开始于: proper([A],[]). proper([],[A]). proper([A|T1],[A|T2]) :- prop
我是 Prolog 的新手,我正在使用 SWI-Prolog v6.6 在 *.pl 中存储断言文件。 :- dynamic fact/2. assert(fact(fact1,fact2)). 使用
我是一名优秀的程序员,十分优秀!