Fast incremental unit propagation by unifying watched-literals and local repair
Name
129947026-MIT.pdf
Description
Full printable version
Size
4.75 MB
Format
Adobe PDF
Checksum (MD5)
11b8a56fe9dc5ca17acbe28e82e612f4
Author(s)
Qu, Shen, S.M. Massachusetts Institute of Technology
Advisor(s)
Brian C. Williams.
Date Issued
2006
Publisher
Massachusetts Institute of Technology
Abstract
The propositional satisfiability problem has been studied extensively due to its theoretical significance and applicability to a variety of fields including diagnosis, autonomous control, circuit testing, and software verification. In these applications, satisfiability problem solvers are often used to solve a large number of problems that are essentially the same and only differ from each other by incremental alterations. Furthermore, unit propagation is a common component of satisfiability problem solvers that accounts for a considerable amount of the solvers' computation time. Given this knowledge, it is desirable to develop incremental unit propagation algorithms that can efficiently perform changes between similar theories. This thesis introduces two new incremental unit propagation algorithms, called Logic-based Truth Maintenance System with Watched-literals and Incremental Truth Maintenance System with Watched-literals. These algorithms combine the strengths of the Logic-based and Incremental Truth Maintenance Systems designed for generic problem solvers with a state-of-the-art satisfiability solver data structure called watched literals.
(cont.) Empirical results show that the use of the watched-literals data structure significantly decreases workload of the LTMS and the ITMS without adversely affecting the incremental performance of these truth maintenance systems.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2006.
Includes bibliographical references (p. 100-102).
Subjects
Aeronautics and Astronautics.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
