Abstract
An unsatisfiable set of constraints is minimal if all its (strict) subsets are satisfiable. The task of type error diagnosis requires finding all minimal unsatisfiable subsets of a given set of constraints (representing an error), in order to generate the best explanation of the error. Similarly circuit error diagnosis requires finding all minimal unsatisfiable subsets in order to make minimal diagnoses. In this paper we present a new approach for efficiently determining all minimal unsatisfiable sets for any kind of constraints. Our approach makes use of the duality that exists between minimal unsatisfiable constraint sets and maximal satisfiable constraint sets. We show how to incrementally compute both these sets, using the fact that the complements of the maximal satisfiable constraint sets are the hitting sets of the minimal unsatisfiable constraint sets. We experimentally compare our technique to the best known method on a number of large type problems and show that considerable improvements in running time are obtained.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bailey, J., Manoukian, T., Ramamohanarao, K.: 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), pp. 485–488 (2003)
Berge, C.: Hypergraphs, North Holland Mathematical Library, vol. 45. Elsevier Science Publishers B.V, North-Holland (1989)
Boros, E., Gurvich, G., Khachiyan, L., Makino, K.: Dual bounded generating problems: Partial and multiple transversals of a hypergraph. SIAM Journal on Computing 30(6), 2036–2050 (2000)
Davey, B., Boland, N., Stuckey, P.J.: Efficient intelligent backtracking using linear programming. INFORMS Journal of Computing 14(4), 373–386 (2002)
de la Banda, M.G., Stuckey, P.J., Wazny, J.: Finding all minimal unsatisfiable subsets. In: Proceedings of the 5th ACM SIGPLAN international conference on Principles and Practice of Declarative Programming, pp. 32–43. ACM Press, New York (2003)
Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24(6), 1278–1304 (1995)
Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms 21(3), 618–628 (1996)
Goethals, B., Zaki, M.: Advances in frequent itemset mining implementations: Introduction to FIMI 2003. In: [9]
Goethals, B., Zaki, M.J. (eds.): Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, FIMI 2003, Melbourne, Florida, USA. CEUR Workshop Proceedings, vol. 90 (2003)
Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharma, R.S.: Discovering all most specific sentences. ACM Transactions on Database Systems 28(2), 140–174 (2003)
Haack, C., Wells, J.B.: Type error slicing in implicitly typed, higher-order languages. In: Degano, P. (ed.) ESOP 2003. LNCS, vol. 2618, pp. 284–301. Springer, Heidelberg (2003)
Han, B., Lee, S.-J.: 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)
Hou, A.: A theory of measurement in diagnosis from first principles. Artificial Intelligence 65, 281–328 (1994)
Paterson, M., Wegman, M.: Linear unification. Journal of Computer and System Sciences 16(2), 158–167 (1978)
Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence 32, 57–95 (1987)
Silva, J., Sakallah, K.: Grasp – a new search algorithm for satisfiability. In: Proceeding of ICCAD 1996, pp. 220–228 (1996)
Sulzmann, M., Wazny, J.: Chameleon, http://www.comp.nus.edu.sg/~sulzmann/chameleon
Takata, K.: 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)
Uno, T., Satoh, K.: Detailed description of an algorithm for enumeration of maximal frequent sets with irredundant dualization. In: [9]
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bailey, J., Stuckey, P.J. (2005). Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization. In: Hermenegildo, M.V., Cabeza, D. (eds) Practical Aspects of Declarative Languages. PADL 2005. Lecture Notes in Computer Science, vol 3350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30557-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-30557-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24362-5
Online ISBN: 978-3-540-30557-6
eBook Packages: Computer ScienceComputer Science (R0)