Author:
Grégoire Éric,Mazure Bertrand,Piette Cédric
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference28 articles.
1. Bailey, J., & Stuckey, P. J. (2005). Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In International Symposium on Practical Aspects of Declarative Languages (PADL’05), pages 174–186.
2. Boussemart, F., Hémery, F., Lecoutre, C., & Saïs, L. (2004). Boosting systematic search by weighting constraints. In European Conference on Artificial Intelligence (ECAI’04), pages 146–150.
3. Brisoux, L., Grégoire, É., & Saïs, L. (2001). Checking depth-limited consistency and inconsistency in knowledge-based systems. Int. J. Intell. Syst. 16(3): 333–360.
4. Bruni, R. (2003). Approximating minimal unsatisfiable subformulae by means of adaptive core search. Discrete Appl. Math. 130(2): 85–100.
5. Bruni, R. (2005). On exact selection of minimally unsatisfiable subformulae. Ann. Math. Artif. Intell. 43(1): 35–50.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献