Extracting minimum unsatisfiable cores with a greedy genetic algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4304 LNAI, Issue , 2006, Pages 847-856

  Zhang, Jianmin ^a   Li, Sikun ^a   Shen, Shengyu ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; BOOLEAN ALGEBRA; BRANCH AND BOUND METHOD; GENETIC ALGORITHMS;

BOOLEAN FORMULAE; BRANCH-AND-BOUND ALGORITHMS; CARDINALITIES; SATISFIABILITY; UNSATISFIABLE CORE;

ARTIFICIAL INTELLIGENCE;

EID: 55149103449     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11941439_89     Document Type: Conference Paper

References (15)

1. Mazure, L. Sais, and E. Gregoire. Boosting complete techniques thanks to local search methods. Annals of Mathematics and Artificial Intelligence, 22(3-4): 319-331, 1998.
2. K. L. McMillan and N. Amla. Automatic abstraction without counterexamples. In Proceedings of the Ninth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03), 2003.
3. G. J. Nam, K. A. Sakallah, and R. A. Rutenbar. Satisfiability-based layout revisited: Detailed routing of complex FPGAs via search-based Boolean SAT. In International Symposium on Field Programmable Gate Arrays (FPGA'99), 1999.
4. C. H. Papadimitriou, and D. Wolfe. The Complexity of Facets Resolved, In Journal of Computer and System Sciences, vol. 37, pp. 2-13, 1988.
5. R. Bruni and A. Sassano. Restoring Satisfiability or Maintaining Unsatisfiability by Finding Small Unsatisfiable Subformulae. In Proceedings of the Workshop on Theory and Application of Satisfiability Testing (SAT'01), 2001.
6. L. Zhang and S. Malik. Extracting small unsatisfiable cores from unsatisfiable Boolean formula. In Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT'03), 2003.
7. Y. Oh, M. N. Mneimneh, Z. S. Andraus, K. A. Sakallah, and I. L. Markov. AMUSE: a minimally-unsatisfiable subformula extractor. In Proceedings of the 41st Design Automation Conference (DAC'04), 2004.
8. J. Huang. MUP: A minimal unsatisfiability prover. In Proceedings of the Tenth Asia and South Pacific Design Automation Conference (ASP-DAC'05), 2005.
9. I. Lynce and J. P. Marques-Silva. On computing minimum unsatisfiable cores. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT'04), 2004.
10. M. H. Liffiton and K. A. Sakallah. On finding all minimally unsatisfiable subformulas. In Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT'05), 2005.
11. J. Bailey and P. J. Stuckey. Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization. In Proceedings of the Seventh International Symposium on Practical Aspects of Declarative Languages (PADL'05), 2005.
12. M. N. Mneimneh, I. Lynce, Z. S. Andraus, J. P. Marques-Silva, and K. A. Sakallah. A branch and bound algorithm for extracting smallest minimal unsatisfiable formulas. In Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT'05), 2005.
13. J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975; MIT Press, Cambridge, second edition, 1992.
14. A. Colorni, M. Dorigo, and V. Maniezzo. Distributed Optimization by Ant Colonies. In Proceedings of the First European Conference on Artificial Life, 1991.
15. SAT benchmarks from Automotive Product Configuration, http: //www-sr. informatik.uni-tuebingen.de/?sinz/DC/.