QUICKXPLAIN: Preferred explanations and relaxations for over-constrained problems

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 167-172

  Junker, Ulrich ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL CIRCUITS; COMPUTER SIMULATION; OPTIMIZATION; PROBLEM SOLVING; RELAXATION OSCILLATORS; USER INTERFACES;

DIVIDE-AND-CONQUER STRATEGY; MODELLING ERRORS; OVER-CONSTRAINED PROBLEMS; SUBSETS;

CONSTRAINT THEORY;

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

References (17)

1. Bakker, R. R.; Dikker, F.; Tempelman, F.; and Wognum, P. M. 1993. Diagnosing and solving over-determined constraint satisfaction problems. In IJCAI-93, 276-281.
2. Brewka, G. 1989. Preferred subtheories: An extended logical framework for default reasoning. In IJCAI-89, 1043-1048.
3. Chinneck, J. W. 1997. Finding a useful subset of constraints for analysis in an infeasible linear porgram. INFORMS Journal on Computing 9:164-174.
4. de Kleer, J. 1986. An assumption-based truth maintenance system. Artificial Intelligence 28:127-162.
5. de la Banda, M. G.; Stuckey, P. J.; and Wazny, J. 2003. Finding all minimal unsatisfiable subsets. In PPDP 2003, 32-43.
6. de Siqueira N., J. L., and Puget, J.-F. 1988. Explanation-based generalisation of failures. In ECAI-88, 339-344.
7. Dechter, R., and Pearl, J. 1989. Tree clustering for constraint networks. Artificial Intelligence 38:353-366.
8. Doyle, J. 1979. A truth maintenance system. Artificial Intelligence 12:231-272.
9. Ginsberg, M., and McAllester, D. 1994. GSAT and dynamic backtracking. In KR'94, 226-237.
10. ILOG. 2003a. ILOG JConfigurator V2.1. Engine programming guide, ILOG S.A., Gentilly, France.
11. ILOG. 2003b. ILOG Solver 6.0. User manual, ILOG S.A., Gentilly, France.
12. Junker, U., and Mailharro, D. 2003. Preference programming: Advanced problem solving for configuration. AI-EDAM 17(1): 13-29.
13. Junker, U. 2002. Preference-based search and multicriteria optimization. In AAAI-02, 34-40.
14. Jussien, N.; Debruyne, R.; and Boizumault, P. 2000. Maintaining arc-consistency within dynamic backtracking. In CP'2000, 249-261.
15. Mauss, J., and Tatar, M. 2002. Computing minimal conflicts for rich constraint languages. In ECAI-02, 151-155.
16. Prosser, P. 1993. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9:268-299.
17. Sqalli, M. H., and Freuder, E. C. 1996. Inference-based constraint satisfaction supports explanation. In AAAI-96, 318-325.