1 / 27

DLL Algorithm

DLL Algorithm. How to realize search in hardware. We need to realize hardware stack Tree search is organized with hardware stack. The node of the tree is variable. The item on the stack is a sum of three literals (in 3SAT, can be more in general POS SAT).

liesel
Download Presentation

DLL Algorithm

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. DLL Algorithm

  2. How to realize search in hardware • We need to realize hardware stack • Tree search is organized with hardware stack. • The node of the tree is variable. • The item on the stack is a sum of three literals (in 3SAT, can be more in general POS SAT). • Encoding: 10 = negated variable, 01 = positive variable, 11 = no variable, 00 = mark or not used. • Example: 1010011101 with order of variables abcd from left means a’ + b’ + c + e (d variable missing) • This encoding is standard to logic, is used in Cube Calculus.

  3. DLL Algorithm • Davis, Logemann and Loveland • M. Davis, G. Logemann and D. Loveland, “A Machine Program for Theorem-Proving”, Communications of ACM, Vol. 5, No. 7, pp. 394-397, 1962 • Basic framework for many modern SAT solvers • Also known as DPLL for historical reasons • DFS – depth first search

  4. Possible representation • Used = converted to 1, satisfied • Non-used = not satisfied yet

  5. Think how to check conflict in hardware using our implementation on stack??!

  6. Problems to think about How can I improve my SAT oracle to allow for implementing DLL in hardware? How can I represent this problem with Pipelining? Can I invent other ideas for backtracking? How to use stack for backtracking? How to represent set of clauses on the stack? You can assume that you solve 3SAT. This will simplify the problem.

More Related