How to minimize a variable in Prolog
0
I am working on a prolog project that I have to minimize one of the variables.
For example:
foo(A,B):-
...
someFunction(A',B',C),
...
someFunction will do something to obtain the value of C. There are many combinations of A' and B' such that there are many Cs available.
For example:
A'1, B'1 -> (C=2)
A'2, B'2 -> (C=0)
A'3, B'3 -> (C=10)
A'4, B'4 -> (C=5)
I want it to try every combination and choose A'2 B'2. What should I do?
prolog
asked Nov 24 '18 at 16:05
SixEggsSixEggs
82
add a comment |
0
I am working on a prolog project that I have to minimize one of the variables.
For example:
foo(A,B):-
...
someFunction(A',B',C),
...
someFunction will do something to obtain the value of C. There are many combinations of A' and B' such that there are many Cs available.
For example:
A'1, B'1 -> (C=2)
A'2, B'2 -> (C=0)
A'3, B'3 -> (C=10)
A'4, B'4 -> (C=5)
I want it to try every combination and choose A'2 B'2. What should I do?
prolog
asked Nov 24 '18 at 16:05
SixEggsSixEggs
82
What'sA'andB'? That's not really valid syntax... How do you know which permutations to try? I imagine the first two arguments ofsomeFunction()are expected to be bound numeric arguments, correct?
– filbranden
Nov 24 '18 at 16:14
Sorry for unclear. You can imagine A and B to be lists of coordinates for two players in a chess game. A' and B' are the updated lists of coordinates after one pass. There are many possible moves. C represents the number of coordinates that the next player can place and win the game. I want to minimize the chance of losing the game by minimizing C. Then A' and B' will become the desired board in next round.
– SixEggs
Nov 24 '18 at 16:23
1
What you've shown is pretty sparse as how your predicate (not function) works. Assuming you're predicate backtracks for each new result, you could usesetof/3to capture all of the solutions of the formC-(A,B)for instance, which will sort in order of the termC, then just take the first element in the resulting list. Or you could recursively, at each new solution, keep the smallest of the two, which is classic minimize predicate behavior. Just a little effort searching this site for[prolog] minimum valueor something similar should turn up lots of ideas as well.
– lurker
Nov 24 '18 at 16:37
add a comment |
0
0
0
I am working on a prolog project that I have to minimize one of the variables.
For example:
foo(A,B):-
...
someFunction(A',B',C),
...
someFunction will do something to obtain the value of C. There are many combinations of A' and B' such that there are many Cs available.
For example:
A'1, B'1 -> (C=2)
A'2, B'2 -> (C=0)
A'3, B'3 -> (C=10)
A'4, B'4 -> (C=5)
I want it to try every combination and choose A'2 B'2. What should I do?
prolog
asked Nov 24 '18 at 16:05
SixEggsSixEggs
82
I am working on a prolog project that I have to minimize one of the variables.
For example:
foo(A,B):-
...
someFunction(A',B',C),
...
someFunction will do something to obtain the value of C. There are many combinations of A' and B' such that there are many Cs available.
For example:
A'1, B'1 -> (C=2)
A'2, B'2 -> (C=0)
A'3, B'3 -> (C=10)
A'4, B'4 -> (C=5)
I want it to try every combination and choose A'2 B'2. What should I do?
prolog
prolog
asked Nov 24 '18 at 16:05
SixEggsSixEggs
82
asked Nov 24 '18 at 16:05
SixEggsSixEggs
82
edited Nov 24 '18 at 16:24
SixEggs
asked Nov 24 '18 at 16:05
SixEggsSixEggs
82
asked Nov 24 '18 at 16:05
SixEggsSixEggs
82
asked Nov 24 '18 at 16:05
SixEggsSixEggs
82
82
What'sA'andB'? That's not really valid syntax... How do you know which permutations to try? I imagine the first two arguments ofsomeFunction()are expected to be bound numeric arguments, correct?
– filbranden
Nov 24 '18 at 16:14
Sorry for unclear. You can imagine A and B to be lists of coordinates for two players in a chess game. A' and B' are the updated lists of coordinates after one pass. There are many possible moves. C represents the number of coordinates that the next player can place and win the game. I want to minimize the chance of losing the game by minimizing C. Then A' and B' will become the desired board in next round.
– SixEggs
Nov 24 '18 at 16:23
1
What you've shown is pretty sparse as how your predicate (not function) works. Assuming you're predicate backtracks for each new result, you could usesetof/3to capture all of the solutions of the formC-(A,B)for instance, which will sort in order of the termC, then just take the first element in the resulting list. Or you could recursively, at each new solution, keep the smallest of the two, which is classic minimize predicate behavior. Just a little effort searching this site for[prolog] minimum valueor something similar should turn up lots of ideas as well.
– lurker
Nov 24 '18 at 16:37
add a comment |
What'sA'andB'? That's not really valid syntax... How do you know which permutations to try? I imagine the first two arguments ofsomeFunction()are expected to be bound numeric arguments, correct?
– filbranden
Nov 24 '18 at 16:14
Sorry for unclear. You can imagine A and B to be lists of coordinates for two players in a chess game. A' and B' are the updated lists of coordinates after one pass. There are many possible moves. C represents the number of coordinates that the next player can place and win the game. I want to minimize the chance of losing the game by minimizing C. Then A' and B' will become the desired board in next round.
– SixEggs
Nov 24 '18 at 16:23
1
What you've shown is pretty sparse as how your predicate (not function) works. Assuming you're predicate backtracks for each new result, you could usesetof/3to capture all of the solutions of the formC-(A,B)for instance, which will sort in order of the termC, then just take the first element in the resulting list. Or you could recursively, at each new solution, keep the smallest of the two, which is classic minimize predicate behavior. Just a little effort searching this site for[prolog] minimum valueor something similar should turn up lots of ideas as well.
– lurker
Nov 24 '18 at 16:37
What's
A' and B'? That's not really valid syntax... How do you know which permutations to try? I imagine the first two arguments of someFunction() are expected to be bound numeric arguments, correct?– filbranden
Nov 24 '18 at 16:14
What's
A' and B'? That's not really valid syntax... How do you know which permutations to try? I imagine the first two arguments of someFunction() are expected to be bound numeric arguments, correct?– filbranden
Nov 24 '18 at 16:14
Sorry for unclear. You can imagine A and B to be lists of coordinates for two players in a chess game. A' and B' are the updated lists of coordinates after one pass. There are many possible moves. C represents the number of coordinates that the next player can place and win the game. I want to minimize the chance of losing the game by minimizing C. Then A' and B' will become the desired board in next round.
– SixEggs
Nov 24 '18 at 16:23
Sorry for unclear. You can imagine A and B to be lists of coordinates for two players in a chess game. A' and B' are the updated lists of coordinates after one pass. There are many possible moves. C represents the number of coordinates that the next player can place and win the game. I want to minimize the chance of losing the game by minimizing C. Then A' and B' will become the desired board in next round.
– SixEggs
Nov 24 '18 at 16:23
1
1
What you've shown is pretty sparse as how your predicate (not function) works. Assuming you're predicate backtracks for each new result, you could use
setof/3 to capture all of the solutions of the form C-(A,B) for instance, which will sort in order of the term C, then just take the first element in the resulting list. Or you could recursively, at each new solution, keep the smallest of the two, which is classic minimize predicate behavior. Just a little effort searching this site for [prolog] minimum value or something similar should turn up lots of ideas as well.– lurker
Nov 24 '18 at 16:37
What you've shown is pretty sparse as how your predicate (not function) works. Assuming you're predicate backtracks for each new result, you could use
setof/3 to capture all of the solutions of the form C-(A,B) for instance, which will sort in order of the term C, then just take the first element in the resulting list. Or you could recursively, at each new solution, keep the smallest of the two, which is classic minimize predicate behavior. Just a little effort searching this site for [prolog] minimum value or something similar should turn up lots of ideas as well.– lurker
Nov 24 '18 at 16:37
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53459961%2fhow-to-minimize-a-variable-in-prolog%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53459961%2fhow-to-minimize-a-variable-in-prolog%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
What's
A'andB'? That's not really valid syntax... How do you know which permutations to try? I imagine the first two arguments ofsomeFunction()are expected to be bound numeric arguments, correct?– filbranden
Nov 24 '18 at 16:14
Sorry for unclear. You can imagine A and B to be lists of coordinates for two players in a chess game. A' and B' are the updated lists of coordinates after one pass. There are many possible moves. C represents the number of coordinates that the next player can place and win the game. I want to minimize the chance of losing the game by minimizing C. Then A' and B' will become the desired board in next round.
– SixEggs
Nov 24 '18 at 16:23
1
What you've shown is pretty sparse as how your predicate (not function) works. Assuming you're predicate backtracks for each new result, you could use
setof/3to capture all of the solutions of the formC-(A,B)for instance, which will sort in order of the termC, then just take the first element in the resulting list. Or you could recursively, at each new solution, keep the smallest of the two, which is classic minimize predicate behavior. Just a little effort searching this site for[prolog] minimum valueor something similar should turn up lots of ideas as well.– lurker
Nov 24 '18 at 16:37