Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization

Lecture Notes in Computer Science

Volumn 3350, Issue , 2005, Pages 174-186

  Bailey, James ^a   Stuckey, Peter J ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Constraint solving; Hitting sets; Hypergraph transversals; Minimal unsatisfiable sets

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ERROR ANALYSIS;

CIRCUIT ERROR DIAGNOSIS; CONSTRAINTS; HITTING SET DUALIZATION; SUBSETS;

SET THEORY;

EID: 23944472232     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30557-6_14     Document Type: Conference Paper

References (19)

1. J. Bailey, T. Manoukian, and K. Ramamohanarao. A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns. In Proceedings of the IEEE International Conference on Data Mining (ICDM), pages 485-488, 2003.
2. C. Berge. Hypergraphs, North Holland Mathematical Library, volume 45. Elsevier Science Publishers B.V (North-Holland), 1989.
3. E. Boros, G. Gurvich, L. Khachiyan, and K. Makino. Dual bounded generating problems: Partial and multiple transversals of a hypergraph. SIAM Journal on Computing, 30(6):2036-2050, 2000.
4. B. Davey, N. Boland, and P.J. Stuckey. Efficient intelligent backtracking using linear programming. INFORMS Journal of Computing, 14(4):373-386, 2002.
5. Maria Garcia de la Banda, Peter J. Stuckey, and Jeremy Wazny. Finding all minimal unsatisfiable subsets. In Proceedings of the 5th ACM SIGPLAN international conference on Principles and Practice of Declarative Programming, pages 32-43. ACM Press, 2003.
6. T. Eiter and G. Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing, 24(6): 1278-1304, 1995.
7. Michael L. Fredman and L. Khachiyan. On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms, 21(3):618-628, 1996.
8. B. Goethals and M. Zaki. Advances in frequent itemset mining implementations: Introduction to FIMI03. In [9].
9. Bart Goethals and Mohammed Javeed Zaki, editors. Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, FIMI'03, volume 90 of CEUR Workshop Proceedings, Melbourne, Florida, USA, 2003.
10. D. Gunopulos, R. Khardon, H. Mannila, S. Saluja, H. Toivonen, and R. S. Sharma. Discovering all most specific sentences. ACM Transactions on Database Systems, 28(2): 140-174, 2003.
11. C. Haack and J. B. Wells. Type error slicing in implicitly typed, higher-order languages. In Proc. of ESOP'03, LNCS, pages 284-301. Springer-Verlag, 2003.
12. B. Han and S-J. Lee. Deriving minimal conflict sets by CS-trees with mark set in diagnosis from first principles. IEEE Transactions on Systems, Man, and Cybernetics, 29(2):281-286, 1999.
13. A. Hou. A theory of measurement in diagnosis from first principles. Artificial Intelligence, 65:281-328, 1994.
14. M. Paterson and M. Wegman. Linear unification. Journal of Computer and System Sciences, 16(2): 158-167, 1978.
15. R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32:57-95, 1987.
16. J. Silva and K Sakallah. Grasp - a new search algorithm for satisfiability. In Proceeding of ICCAD'96, pages 220-228, 1996.
17. M. Sulzmann and J. Wazny. Chameleon. http://www.comp.nus.edu.sg/ ~sulzmann/chameleon.
18. K. Takata. On the Sequential Method for Listing Minimal Hitting Sets. In Proceedings Workshop on Discrete Mathematics and Data Mining, 2nd SIAM International Conference on Data Mining, 2002.
19. T. Uno and K. Satoh. Detailed description of an algorithm for enumeration of maximal frequent sets with irredundant dualization. In [9].