Reduction of satisfiability to integer linear programming











up vote
0
down vote

favorite












Given an instance of SAT, how do I exhibit that instance of SAT into ILP? Do I have to find the satisfying assignment for f first or does this not matter?










share|cite|improve this question






















  • You're going to produce an ILP whose solution (if it exists) can be transformed back into a solution of the original SAT problem. You don't need to find a satisfying assignment first (and one might not exist.)
    – Brian Borchers
    Nov 18 at 15:43















up vote
0
down vote

favorite












Given an instance of SAT, how do I exhibit that instance of SAT into ILP? Do I have to find the satisfying assignment for f first or does this not matter?










share|cite|improve this question






















  • You're going to produce an ILP whose solution (if it exists) can be transformed back into a solution of the original SAT problem. You don't need to find a satisfying assignment first (and one might not exist.)
    – Brian Borchers
    Nov 18 at 15:43













up vote
0
down vote

favorite









up vote
0
down vote

favorite











Given an instance of SAT, how do I exhibit that instance of SAT into ILP? Do I have to find the satisfying assignment for f first or does this not matter?










share|cite|improve this question













Given an instance of SAT, how do I exhibit that instance of SAT into ILP? Do I have to find the satisfying assignment for f first or does this not matter?







computational-complexity






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 18 at 14:03









C.Lako

263




263












  • You're going to produce an ILP whose solution (if it exists) can be transformed back into a solution of the original SAT problem. You don't need to find a satisfying assignment first (and one might not exist.)
    – Brian Borchers
    Nov 18 at 15:43


















  • You're going to produce an ILP whose solution (if it exists) can be transformed back into a solution of the original SAT problem. You don't need to find a satisfying assignment first (and one might not exist.)
    – Brian Borchers
    Nov 18 at 15:43
















You're going to produce an ILP whose solution (if it exists) can be transformed back into a solution of the original SAT problem. You don't need to find a satisfying assignment first (and one might not exist.)
– Brian Borchers
Nov 18 at 15:43




You're going to produce an ILP whose solution (if it exists) can be transformed back into a solution of the original SAT problem. You don't need to find a satisfying assignment first (and one might not exist.)
– Brian Borchers
Nov 18 at 15:43










1 Answer
1






active

oldest

votes

















up vote
0
down vote













Recall that in SAT, you are given a Boolean formula:



$F = (x_1 + x_2 + bar{x_2}) * (x_4 + x_5) + ... $



Note that $F$ is satisfiable iff every clause is satisfiable.

That is, for each clause, at least one of the $x_i$ is true.

If we represent true by 1 and false by 0, we can reduce SAT to ILP by creating a constraint for each clause:



$x_1 + + x_2 + bar{x_2} ge 1$
$x_4 + + x_5 ge 1$

...






share|cite|improve this answer





















    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',
    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


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3003572%2freduction-of-satisfiability-to-integer-linear-programming%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    0
    down vote













    Recall that in SAT, you are given a Boolean formula:



    $F = (x_1 + x_2 + bar{x_2}) * (x_4 + x_5) + ... $



    Note that $F$ is satisfiable iff every clause is satisfiable.

    That is, for each clause, at least one of the $x_i$ is true.

    If we represent true by 1 and false by 0, we can reduce SAT to ILP by creating a constraint for each clause:



    $x_1 + + x_2 + bar{x_2} ge 1$
    $x_4 + + x_5 ge 1$

    ...






    share|cite|improve this answer

























      up vote
      0
      down vote













      Recall that in SAT, you are given a Boolean formula:



      $F = (x_1 + x_2 + bar{x_2}) * (x_4 + x_5) + ... $



      Note that $F$ is satisfiable iff every clause is satisfiable.

      That is, for each clause, at least one of the $x_i$ is true.

      If we represent true by 1 and false by 0, we can reduce SAT to ILP by creating a constraint for each clause:



      $x_1 + + x_2 + bar{x_2} ge 1$
      $x_4 + + x_5 ge 1$

      ...






      share|cite|improve this answer























        up vote
        0
        down vote










        up vote
        0
        down vote









        Recall that in SAT, you are given a Boolean formula:



        $F = (x_1 + x_2 + bar{x_2}) * (x_4 + x_5) + ... $



        Note that $F$ is satisfiable iff every clause is satisfiable.

        That is, for each clause, at least one of the $x_i$ is true.

        If we represent true by 1 and false by 0, we can reduce SAT to ILP by creating a constraint for each clause:



        $x_1 + + x_2 + bar{x_2} ge 1$
        $x_4 + + x_5 ge 1$

        ...






        share|cite|improve this answer












        Recall that in SAT, you are given a Boolean formula:



        $F = (x_1 + x_2 + bar{x_2}) * (x_4 + x_5) + ... $



        Note that $F$ is satisfiable iff every clause is satisfiable.

        That is, for each clause, at least one of the $x_i$ is true.

        If we represent true by 1 and false by 0, we can reduce SAT to ILP by creating a constraint for each clause:



        $x_1 + + x_2 + bar{x_2} ge 1$
        $x_4 + + x_5 ge 1$

        ...







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 25 at 0:02









        user137481

        1,7752921




        1,7752921






























            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3003572%2freduction-of-satisfiability-to-integer-linear-programming%23new-answer', 'question_page');
            }
            );

            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







            Popular posts from this blog

            Probability when a professor distributes a quiz and homework assignment to a class of n students.

            Aardman Animations

            Are they similar matrix