Algorithm for PDL
1
$begingroup$
Provide the polynomial time algorithm to check if a PDL (Propositional Dynamic Logic) formula is satisfied in a given state in a given Kripke Frame.
My question is how to construct such an algorithm.
logic algorithms computational-complexity
asked Sep 15 '18 at 11:06
Adam MataAdam Mata
607
$endgroup$
add a comment |
1
$begingroup$
Provide the polynomial time algorithm to check if a PDL (Propositional Dynamic Logic) formula is satisfied in a given state in a given Kripke Frame.
My question is how to construct such an algorithm.
logic algorithms computational-complexity
asked Sep 15 '18 at 11:06
Adam MataAdam Mata
607
$endgroup$
$begingroup$
From @Atugo: I guess there should be some further restrictions on the model. At least the models should be finite in some sense, otherwise this may even not be decidable. Just think of the basic modal logic, and ask if the formula ◊p hold on a state s with infinitely many t such that Rst.
$endgroup$
– dantopa
Jan 9 at 22:55
add a comment |
1
1
1
$begingroup$
Provide the polynomial time algorithm to check if a PDL (Propositional Dynamic Logic) formula is satisfied in a given state in a given Kripke Frame.
My question is how to construct such an algorithm.
logic algorithms computational-complexity
asked Sep 15 '18 at 11:06
Adam MataAdam Mata
607
$endgroup$
Provide the polynomial time algorithm to check if a PDL (Propositional Dynamic Logic) formula is satisfied in a given state in a given Kripke Frame.
My question is how to construct such an algorithm.
logic algorithms computational-complexity
logic algorithms computational-complexity
asked Sep 15 '18 at 11:06
Adam MataAdam Mata
607
asked Sep 15 '18 at 11:06
Adam MataAdam Mata
607
edited Sep 17 '18 at 13:43
Adam Mata
asked Sep 15 '18 at 11:06
Adam MataAdam Mata
607
asked Sep 15 '18 at 11:06
Adam MataAdam Mata
607
asked Sep 15 '18 at 11:06
Adam MataAdam Mata
607
607
$begingroup$
From @Atugo: I guess there should be some further restrictions on the model. At least the models should be finite in some sense, otherwise this may even not be decidable. Just think of the basic modal logic, and ask if the formula ◊p hold on a state s with infinitely many t such that Rst.
$endgroup$
– dantopa
Jan 9 at 22:55
add a comment |
$begingroup$
From @Atugo: I guess there should be some further restrictions on the model. At least the models should be finite in some sense, otherwise this may even not be decidable. Just think of the basic modal logic, and ask if the formula ◊p hold on a state s with infinitely many t such that Rst.
$endgroup$
– dantopa
Jan 9 at 22:55
$begingroup$
From @Atugo: I guess there should be some further restrictions on the model. At least the models should be finite in some sense, otherwise this may even not be decidable. Just think of the basic modal logic, and ask if the formula ◊p hold on a state s with infinitely many t such that Rst.
$endgroup$
– dantopa
Jan 9 at 22:55
$begingroup$
From @Atugo: I guess there should be some further restrictions on the model. At least the models should be finite in some sense, otherwise this may even not be decidable. Just think of the basic modal logic, and ask if the formula ◊p hold on a state s with infinitely many t such that Rst.
$endgroup$
– dantopa
Jan 9 at 22:55
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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
},
noCode: 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%2fmath.stackexchange.com%2fquestions%2f2917713%2falgorithm-for-pdl%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 Mathematics Stack Exchange!
- 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.
Use MathJax to format equations. MathJax reference.
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%2fmath.stackexchange.com%2fquestions%2f2917713%2falgorithm-for-pdl%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
$begingroup$
From @Atugo: I guess there should be some further restrictions on the model. At least the models should be finite in some sense, otherwise this may even not be decidable. Just think of the basic modal logic, and ask if the formula ◊p hold on a state s with infinitely many t such that Rst.
$endgroup$
– dantopa
Jan 9 at 22:55