A Topology Graph Algorithm Based on Lattice-Valued Logic to Solve Satisfiability Problems

<div>A one-layer branch topology of <span class="nowrap"><svg height="11.8174pt" id="M124" style="vertical-align:-3.1815pt" version="1.1" viewbox="-0.0498162 -8.6359 13.6974 11.8174" width="13.6974pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,8.619,3.132)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z"></path></g></svg>.</span></div>

Mathematical Problems in Engineering

fig2

Figure 2

Figure 2: A Topology Graph Algorithm Based on Lattice-Valued Logic to Solve Satisfiability Problems 