KSL-01-16

Solving Satisfiability using Decomposition and the Most Constrained Subproblem

Reference: Amir, E. & McIlraith, S. Solving Satisfiability using Decomposition and the Most Constrained Subproblem. Proceedings of SAT 2001: the Workshop on Theory and Applications of Satisfiability Testing. Electronic Notes in Discrete Mathematics, Volume 9, Henry Kautz and Bart Selman (Ed.), June, 2001, 2001.

Abstract:

Full paper available as ps.


Jump to... [KSL] [SMI] [Reports by Author] [Reports by KSL Number] [Reports by Year]
Send mail to: ksl-info@ksl.stanford.edu to send a message to the maintainer of the KSL Reports.