NMUS: Structural analysis for improving the derivation of all MUSes in overconstrained numeric CSPs

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

Volumn 4788 LNAI, Issue , 2007, Pages 160-169

  Gasea, R M ^a   Del Valle, C ^a   Gomez Lopez M T ^a   Ceballos, R ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FAILURE ANALYSIS; MATHEMATICAL MODELS; NUMERICAL METHODS; POLYNOMIALS; PROBLEM SOLVING;

NUMERIC CONSTRAINT SATISFACTION PROBLEMS (NCSP); NUMERIC CONSTRAINTS;

STRUCTURAL DESIGN;

EID: 38349039429     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. Bailey, J., Stuckey, P. J.: Discovery of Minimal Unsatisfiable Subsets of Constraints using Hitting set dualization. In: Hermenegildo, M.V., Cabeza, D. (eds.) Practical Aspects of Declarative Languages. LNCS, vol. 3350, pp. 174-186. Springer, Heidelberg (2005)
2. Bruni, R.: Approximating minimal unsatisfiable subformulae by means of adaptive core search. Discrete Applied Mathematics 130, 85-100 (2003)
3. Ceballos, R., Gómez-López, M.T., Gasea, M.T.R.M., del Valle, C.: Integración de técnicas basadas en modelos para la determinación de la diagnosis mínima de un sistema. Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial No. 31, pp. 41-51 (2006)
4. Chinneck, J., Dravnieks, E.: Locating minimal infeasible constraint sets in linear programs. ORSA Journal on Computing 3, 157-168 (1991)
5. de la Banda, M.G., Stuckey, P.J., Wazny, J.: Finding all minimal unsatisfiable subsets. In: PPDP 2003. Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, pp. 32-43. ACM Press, New York (2003)
6. Gómez, M.T., Ceballos, R., Gasea, R.M., Del Valle, C.: Constraint Databases Technology for Polynomial Models Diagnosis. In: Proceedings DX 2004 (2004)
7. Grégoire, E., Mazure, B., Piette, C.: Local-Search Extraction of MUSes. Constraints 12(3) (2007)
8. Junker, U.: QuickXPlain. In: Conflict Detection for Arbitatrary Constraint Propagation Algorithms Proceedings IJCAI 2001 (2001)
9. Liffiton, M., Sakallah, K.: On finding all minimally unsatisfiable subformulas. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 173-186. Springer, Heidelberg (2005)
10. Mauss, J., Tatar, M.: Computing Minimal Conflicts for Rich Constraint Languages. In: ECAI, pp. 151-155 (2002)
11. Moffitt, M.D., Pollack, M.E.: Applying Local Search to Disjunctive Temporal Problems. In: Proced. IJCAI (2005)
12. Liffiton, M.H., Moffitt, M.D., Pollack, M.E., Sakallah, K.A.: Identifying Conflicts in Overconstrained Temporal Problems. In: Proceedings IJCAI 2007 (2007)
13. Oh, Y., Mneimneh, M.N., Andraus, Z.S., Sakallah, K.A., Markov, I.L.: AMUSE: A Minimally-Unsatisfiable Subformula Extractor. In: Proceedings of the Design Automation Conference (DAC 2004), ACM/IEEE, pp. 518-523 (2004)