Extracting MUCs from constraint networks

Frontiers in Artificial Intelligence and Applications

Volumn 141, Issue , 2006, Pages 113-117

  Hemery, Fred ^a   Lecoutre, Christophe ^a   Sais, Lakhdar ^a   Boussemart, Frédéric ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATIONS DOMAINS; BACKTRACKING SEARCH; CONFIGURATION PLANNING; CONSTRAINT NETWORKS; CONSTRAINT WEIGHTING; DICHOTOMIC PROCESS; HARD PROBLEMS; UNSATISFIABLE CORE;

EID: 84886003953     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article

References (23)

1. R.R. Baker, F. Dikker, F. Tempelman, and P.M. Wognum, 'Diagnosing and solving over-determined constraint satisfaction problems', in Proceedings of IJCAI'93, pp. 276-281, (1993).
2. F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, 'Boosting systematic search by weighting constraints', in Proceedings of ECAI'04, pp. 146-150, (2004).
3. R. Bruni and A. Sassano, 'Detecting minimaly unsatisfiable subformulae in unsatisfiable SAT instances by means of adaptative core search', in Proceedings of SAT'00, (2000).
4. H. Kleine Buning, 'On subclasses of minimal unsatisfiable formulas', Discrete Applied Mathematics, 107(1-3), 83-98, (2000).
5. M. Garcia de la Banda, P.J. Stuckey, and J. Wazny, 'Finding all minimal unsatisfiable subsets', in Proceedings of PPDP'03, (2003).
6. J.L. de Siqueira and J.F. Puget, 'Explanation-based generalisation of failures', in Proceedings of ECAI'88, pp. 339-344, (1988).
7. H. Fleischner, O. Kullmann, and S. Szeider, 'Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference', Theoretical Computer Science, 289, 503-516, (2002).
8. M. Ginsberg, 'Dynamic backtracking', Artificial Intelligence, 1, 25-46, (1993).
9. B. Han and S-J. Lee, 'Deriving minimal conflict sets by cs-trees with mark set in diagnosis from first principles', IEEE Tansactions on Systems, Man and Cybernetics, 29(2), 281-286, (1999).
10. T. Hulubei and B. O'Sullivan, 'Search heuristics and heavy-tailed behaviour', in Proceedings of CP'05, pp. 328-342, (2005).
11. U. Junker, 'QuickXplain: conflict detection for abitrary constraint propagation algorithms', in Proceedings of IJCAI'01 Workshop on modelling and solving problems with constraints, pp. 75-82, (2001).
12. U. Junker, 'QuickXplain: preferred explanations and relaxations for over-constrained problems', in Proc. of AAAI'04, pp. 167-172, (2004).
13. N. Jussien and V. Barichard, 'The palm system: explanation-based constraint programming', in Proc. of TRICS'00, pp. 118-133, (2000).
14. C. Lecoutre, F. Boussemart, and F. Hemery, 'Backjump-based techniques vs conflict-directed heuristics', ICTAI'04, pp. 549-557, (2004).
15. I. Lynce and J.P. Marques-Silva, 'On computing minimum unsatisfiable cores', in Proceedings of SAT'04, (2004).
16. A.K. Mackworth, 'Consistency in networks of relations', Artificial Intelligence, 8(1), 99-118, (1977).
17. J.P. Marques-Silva and K.A. Sakallah, 'Conflict analysis in search algorithms for propositional satisfiability', Technical Report RT/4/96, INESC, Lisboa, Portugal, (1996).
18. J. Mauss and M. Tatar, 'Computing minimal conflicts for rich constraint languages', in Proceedings of ECAI'02, pp. 151-155, (2002).
19. Y. Oh, M.N. Mneimneh, Z.S. Andraus, K.A. Sakallah, and I.L. Markov, 'AMUSE: A minimally-unsatisfiable subformula extractor', in Proceedings of DAC'04, pp. 518-523, (2004).
20. C.H. Papadimitriou and D. Wolfe, 'The complexity of facets resolved', Journal of Computer and System Sciences, 37, 2-13, (1988).
21. T. Petit, C. Bessìere, and J.C. Régin, 'A general conflict-set based framework for partial constraint satisfaction', in Proceedings of SOFT'03 workshop held with CP'03, (2003).
22. P. Prosser, 'Hybrid algorithms for the constraint satisfaction problems', Computational Intelligence, 9(3), 268-299, (1993).
23. L. Zhang and S. Malik, 'Extracting small unsatisfiable cores from unsatisfiable boolean formulas', in Proceedings of SAT'03, (2003).