Are there any proof assistants based on logic programming?
$begingroup$
Logic programming is a programming language paradigm. In it, a programmer creates a bunch of axioms in the form of horn clauses, representing computations, which the implementation of the language then solves to generate the output.
My question is, are there any proof assistants based on logic programming? That is, are there any proof assistants whose proof language is a Logic programming language?
If not, is it because no one has bothered, or is there something fundamentally wrong with the idea?
reference-request soft-question predicate-logic programming computer-assisted-proofs
$endgroup$
add a comment |
$begingroup$
Logic programming is a programming language paradigm. In it, a programmer creates a bunch of axioms in the form of horn clauses, representing computations, which the implementation of the language then solves to generate the output.
My question is, are there any proof assistants based on logic programming? That is, are there any proof assistants whose proof language is a Logic programming language?
If not, is it because no one has bothered, or is there something fundamentally wrong with the idea?
reference-request soft-question predicate-logic programming computer-assisted-proofs
$endgroup$
1
$begingroup$
Twelf?
$endgroup$
– Alexis
Jan 29 at 3:29
$begingroup$
@Alexis Yeah, that would work.
$endgroup$
– PyRulez
Jan 29 at 3:41
add a comment |
$begingroup$
Logic programming is a programming language paradigm. In it, a programmer creates a bunch of axioms in the form of horn clauses, representing computations, which the implementation of the language then solves to generate the output.
My question is, are there any proof assistants based on logic programming? That is, are there any proof assistants whose proof language is a Logic programming language?
If not, is it because no one has bothered, or is there something fundamentally wrong with the idea?
reference-request soft-question predicate-logic programming computer-assisted-proofs
$endgroup$
Logic programming is a programming language paradigm. In it, a programmer creates a bunch of axioms in the form of horn clauses, representing computations, which the implementation of the language then solves to generate the output.
My question is, are there any proof assistants based on logic programming? That is, are there any proof assistants whose proof language is a Logic programming language?
If not, is it because no one has bothered, or is there something fundamentally wrong with the idea?
reference-request soft-question predicate-logic programming computer-assisted-proofs
reference-request soft-question predicate-logic programming computer-assisted-proofs
asked Jan 29 at 1:10


PyRulezPyRulez
4,99222471
4,99222471
1
$begingroup$
Twelf?
$endgroup$
– Alexis
Jan 29 at 3:29
$begingroup$
@Alexis Yeah, that would work.
$endgroup$
– PyRulez
Jan 29 at 3:41
add a comment |
1
$begingroup$
Twelf?
$endgroup$
– Alexis
Jan 29 at 3:29
$begingroup$
@Alexis Yeah, that would work.
$endgroup$
– PyRulez
Jan 29 at 3:41
1
1
$begingroup$
Twelf?
$endgroup$
– Alexis
Jan 29 at 3:29
$begingroup$
Twelf?
$endgroup$
– Alexis
Jan 29 at 3:29
$begingroup$
@Alexis Yeah, that would work.
$endgroup$
– PyRulez
Jan 29 at 3:41
$begingroup$
@Alexis Yeah, that would work.
$endgroup$
– PyRulez
Jan 29 at 3:41
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
});
}
});
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%2f3091617%2fare-there-any-proof-assistants-based-on-logic-programming%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
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.
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%2f3091617%2fare-there-any-proof-assistants-based-on-logic-programming%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
1
$begingroup$
Twelf?
$endgroup$
– Alexis
Jan 29 at 3:29
$begingroup$
@Alexis Yeah, that would work.
$endgroup$
– PyRulez
Jan 29 at 3:41