MUP: A minimal unsatisfiability prover

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn 1, Issue , 2005, Pages 432-437

  Huang, Jinbo ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CNF FORMULAS; EMPIRICAL EVALUATIONS; HARD PROBLEMS; ITS EFFICIENCIES; MINIMALITY; OPTIMAL RESULTS; SAT INSTANCES; SUBFORMULAS; TREE-WIDTH; TYPICAL DESIGN;

COMPUTER AIDED DESIGN;

ALGORITHMS;

EID: 84861427567     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Ron Aharoni and Nathan Linial. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. Journal of Combinatorial Theory Series A, 43:196-204, 1989.
2. Fadi AlouL. Igor Markov, and Karem Sakallah. Faster SAT and smaller BDDs via common function structure- In International Conference on Computer Aided Design- (ICCAD), University of Michigan, 2001. Tool available for download at http://www.eeC5.ijmich.edu/~falouI/Tools/mince/
3. SAT Benchmarks from Automotive Product Configuration, http://www-sr.informatik.uni-tuebingen.de/~sinz/DC/.
4. H. L. Bodlaender, J. R. Gilbert, H. Hafsteinssors, and T. Kloks. Approximating treewidth, pathwidth, and minimum elimination tree height. Journal of Algorithms, 18:238-255, 1995. .
5. Renato Bruni. Approximating minimal unsatisfiable subformu-lae by means of adaptive core search. Discrete Applied Mathematics, 130(2):85-100, 2003.
6. Renato Bruni and Antonio Sassano. Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable sub-formulae. Electronic Notes in Discrete Mathematics, 9, 2001.
7. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677-691, 1986.
8. Hans Kleine Buning. On subclasses of minimal unsatisfiable formulas. Discrete Applied Mathematics, 107(1-3):83-98, 2000.
9. J. R. Burch, E. M. Clarke, andD. E. Long. Symbolic model checking with partitioned transition relations. In Proceedings of the International Conference on Very Large Scale Integration, 1991.
10. Adnan Darwiche and Mark Hopkins. Using recursive decomposition to construct elimination orders, jointrees and dtrees. In Trends in Artificial Intelligence, Lecture notes in AI, 2143, pages 180-191. Springer-Verlag, 2001.
11. Gennady Davydov, Inna Davydova, and Hans Kleine Buning. An efficient algorithm'for the minimal unsatisfiability problem for a subclass of CNF. Annals of Mathematics and Artificial Intelligence, 23(3-4) :229-245, 1998.
12. Rina Dechter. Bucket elimination: A unifying framework for probabilistic inference. In Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence, pages 211-219, 1996.
13. Herbert Fleischner, Oliver Kullmarin, and Stefan Szeider. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoretical Computer Science, 289(1):503-516, 2002
14. R. Hojati, S. G. Krishnan, and R. K. Brayton. Early quantification and partitioned transition relations. In Proceedings of the International Conference on Computer Design, pages 12-19, 1996
15. Holger H. Hoos and Thomas Sttzle, SATLIB: An Online Resource for Research on SAT. In I.P.Gent, H.v.Maaren, T. Walsh, editors, SAT 2000, pages 283-292. IOS Press, 2000. SATLIB is available online at wimii.sattib.org.
16. Jinbo Huang and Adnan Darwiche. Toward good elimination orders for symbolic SAT solving. In Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), November 2004.
17. Oliver Kullmann. An application of matroid theory to the SAT problem. In Proceedings of the 15th Annual IEEE Conference on Computational Complexity, pages 116-124, 2000
18. Matthew Moskewicz, Conor Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 39th Design Automation Conference, 2001.
19. Yoonna Oh, Maher N. Mneimneh, Zafier S. Andraus, Karem A. Sakallah, and Igor L. Markov. AMUSE: a minimally-unsatisfiable subformula extractor. In Proceedings of the 41st Annual Conference on Design Automation, pages 518-523. ACM Press, 2004.
20. Christos H. Papadimitriou and David Wolfe. The complexity of facets resolved. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pages 74-78, 1985.
21. Christos H. Papadimitriou and Mihalis Yannakakis. The complexity of facets (and some facets of complexity). In Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pages 255-260. ACM Press, 1982.
22. The Annual SAT Competitions:http://www.satlive.org/SATCompetition/.
23. Carsten Sinz, Andreas Kaiser, and Wolfgang Kchlin. Formal methods for the validation of automotive product configuration data. Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 17(2), 2003.
24. Fabio Somenzi. CUDD: CU Decision Diagram Package. Release 2.4.0.
25. Stefan Szeider. Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. In Proceedings of the Nineth International Computing and Combinatorics Conference, pages 548-558. Springer Verlag, 2003.
26. Dimitfios Thilikos, Maria Serha, and Hans Bodlaender. A polynomial algorithm for the cutwidth of bounded degree graphs with small treewidth. Lecture Notes in Computer Science, 2161:380-390, 2001.
27. H. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni- Vincentelli. Implicit enumeration of finite state machines using BDDs, In Proceedings of the IEEE International Conferece on Computer Aided Design, pages 130-133, 1990.
28. Alasdair Urquhart. Hard examples for resolution. Journal of the ACM, 34(1):209-219, 1987.
29. Lintao Zhang and Sharad Malik. Extracting small unsatisfiable cores from unsatisfiable Boolean formula. Presented at the Sixth International Conference on Theory and Applications of Satisfiability Testing, 2003.