-
1
-
-
84886003953
-
Extracting MUCs from constraint networks
-
Hemery, F., Lecoutre, C., Saïs, L., Boussemart, F.: Extracting MUCs from constraint networks. In: ECAI'06. Proceedings of the 17th European Conference on Artificial Intelligence, pp. 113-117 (2006)
-
(2006)
ECAI'06. Proceedings of the 17th European Conference on Artificial Intelligence
, pp. 113-117
-
-
Hemery, F.1
Lecoutre, C.2
Saïs, L.3
Boussemart, F.4
-
2
-
-
84886072385
-
Extracting MUSes
-
Grégoire, E., Mazure, B., Piette, C.: Extracting MUSes. In: ECAI'06. Proceedings of the 17th European Conference on Artificial Intelligence, pp. 387-391 (2006)
-
(2006)
ECAI'06. Proceedings of the 17th European Conference on Artificial Intelligence
, pp. 387-391
-
-
Grégoire, E.1
Mazure, B.2
Piette, C.3
-
3
-
-
0026940077
-
On the complexity of propositional knowledge base revision, updates and counterfactual
-
Eiter, T., Gottlob, G.: On the complexity of propositional knowledge base revision, updates and counterfactual. Artificial Intelligence 57, 227-270 (1992)
-
(1992)
Artificial Intelligence
, vol.57
, pp. 227-270
-
-
Eiter, T.1
Gottlob, G.2
-
6
-
-
84897712733
-
-
Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, 1894, pp. 441-456. Springer, Heidelberg (2000)
-
Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441-456. Springer, Heidelberg (2000)
-
-
-
-
8
-
-
38149064702
-
A general conflict-set based framework for partial constraint satisfaction
-
Rossi, F, ed, CP, Springer, Heidelberg
-
Petit, T., Bessière, C., Régin, J.: A general conflict-set based framework for partial constraint satisfaction. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, Springer, Heidelberg (2003)
-
(2003)
LNCS
, vol.2833
-
-
Petit, T.1
Bessière, C.2
Régin, J.3
-
10
-
-
84945915031
-
Maintaining arc-consistency within dynamic backtracking
-
Jussien, N., Debruyne, R., Boizumault, P.: Maintaining arc-consistency within dynamic backtracking. In: Principles and Practice of Constraint Programming, pp. 249-261 (2000)
-
(2000)
Principles and Practice of Constraint Programming
, pp. 249-261
-
-
Jussien, N.1
Debruyne, R.2
Boizumault, P.3
-
11
-
-
0001372340
-
Hybrid algorithms for the constraint satisfaction problems
-
Prosser, P.: Hybrid algorithms for the constraint satisfaction problems. Computational Intelligence 9(3), 268-299 (1993)
-
(1993)
Computational Intelligence
, vol.9
, Issue.3
, pp. 268-299
-
-
Prosser, P.1
-
13
-
-
0033115297
-
Deriving minimal conflict sets by CS-Trees with mark set in diagnosis from first principles
-
Han, B., Lee, S.: Deriving minimal conflict sets by CS-Trees with mark set in diagnosis from first principles. IEEE Transactions on Systems, Man, and Cybernetics 29, 281-286 (1999)
-
(1999)
IEEE Transactions on Systems, Man, and Cybernetics
, vol.29
, pp. 281-286
-
-
Han, B.1
Lee, S.2
-
14
-
-
1242287835
-
Finding all minimal unsatisfiable subsets
-
de la Banda, M., Stuckey, P.J., Wazny, J.: Finding all minimal unsatisfiable subsets. In: Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDL'03), pp. 32-43 (2003)
-
(2003)
Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDL'03)
, pp. 32-43
-
-
de la Banda, M.1
Stuckey, P.J.2
Wazny, J.3
-
17
-
-
0004107567
-
The PaLM system: Explanation-based constraint programming
-
Dechter, R, ed, CP, Springer, Heidelberg
-
Jussien, N., Barichard, V.: The PaLM system: explanation-based constraint programming. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 118-133. Springer, Heidelberg (2000)
-
(2000)
LNCS
, vol.1894
, pp. 118-133
-
-
Jussien, N.1
Barichard, V.2
-
18
-
-
38149130727
-
-
Laburthe, F., Team, T.O.P.: Choco: implementing a cp kernel. In: Dechter, R. (ed.) CP 2000. LNCS, 1894, Springer, Heidelberg (2000). http: //www.choco-constraints.net
-
Laburthe, F., Team, T.O.P.: Choco: implementing a cp kernel. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, Springer, Heidelberg (2000). http: //www.choco-constraints.net
-
-
-
-
19
-
-
0344057203
-
Diagnosing and solving over-determined constraint satisfaction problems
-
Morgan Kaufmann, San Francisco
-
Bakker, R.R., Dikker, F., Tempelman, F., Wognum, P.M.: Diagnosing and solving over-determined constraint satisfaction problems. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (UCAI'93), vol. 1, pp. 276-281. Morgan Kaufmann, San Francisco (1993)
-
(1993)
Proceedings of the 13th International Joint Conference on Artificial Intelligence (UCAI'93)
, vol.1
, pp. 276-281
-
-
Bakker, R.R.1
Dikker, F.2
Tempelman, F.3
Wognum, P.M.4
-
20
-
-
0042014224
-
Approximating minimal unsatisfiable subformulae by means of adaptive core search
-
Bruni, R.: Approximating minimal unsatisfiable subformulae by means of adaptive core search. Discrete Applied Mathematics 130(2), 85-100 (2003)
-
(2003)
Discrete Applied Mathematics
, vol.130
, Issue.2
, pp. 85-100
-
-
Bruni, R.1
-
21
-
-
38149082855
-
-
Zhang, L., Malik, S.: Extracting small unsatisfiable cores from unsatisfiable boolean formula. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, 2919. Springer, Heidelberg (2004)
-
Zhang, L., Malik, S.: Extracting small unsatisfiable cores from unsatisfiable boolean formula. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919. Springer, Heidelberg (2004)
-
-
-
-
23
-
-
26444609633
-
-
Mneimneh, M.N., Lynce, I., Andraus, Z.S., Marques Silva, J.P., Sakallah, K.A.: A branchand-bound algorithm for extracting smallest minimal unsatisfiable formulas. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, 3569, pp. 467-474. Springer, Heidelberg (2005)
-
Mneimneh, M.N., Lynce, I., Andraus, Z.S., Marques Silva, J.P., Sakallah, K.A.: A branchand-bound algorithm for extracting smallest minimal unsatisfiable formulas. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 467-474. Springer, Heidelberg (2005)
-
-
-
-
24
-
-
4444353562
-
AMUSE: A minimally-unsatisfiable subformula extractor
-
Oh, Y., Mneimneh, M., Andraus, Z., Sakallah, K., Markov, I.: AMUSE: a minimally-unsatisfiable subformula extractor. In: Proceedings of the 41th Design Automation Conference (DAC 2004), pp. 518-523 (2004)
-
(2004)
Proceedings of the 41th Design Automation Conference (DAC
, pp. 518-523
-
-
Oh, Y.1
Mneimneh, M.2
Andraus, Z.3
Sakallah, K.4
Markov, I.5
-
25
-
-
26444450510
-
-
Liffiton, M., Sakallah, K.: On finding all minimally unsatisfiable subformulas. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, 3569, pp. 173-186. Springer, Heidelberg (2005)
-
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)
-
-
-
-
26
-
-
34547210545
-
Boosting a complete technique to find MSSes and MUSes thanks to a local search oracle
-
Grégoire, E., Mazure, B., Piette, C.: Boosting a complete technique to find MSSes and MUSes thanks to a local search oracle. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'07), vol. 2, pp. 2300-2305 (2007)
-
(2007)
Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'07)
, vol.2
, pp. 2300-2305
-
-
Grégoire, E.1
Mazure, B.2
Piette, C.3
-
27
-
-
38149062206
-
Generalized filtrering algorithms for infeasibility analysis
-
to appear
-
Atlihan, M., Schrage, L.: Generalized filtrering algorithms for infeasibility analysis. Computers and Operations Research (to appear, 2007)
-
(2007)
Computers and Operations Research
-
-
Atlihan, M.1
Schrage, L.2
-
28
-
-
34547205000
-
Local-search extraction of MUSes
-
Satisfaction , to appear
-
Grégoire, E., Mazure, B., Piette, C.: Local-search extraction of MUSes. Constraints Journal: Special issue on Local Search in Constraint Satisfaction 12(3) (to appear, 2007)
-
(2007)
Constraints Journal: Special issue on Local Search in Constraint
, vol.12
, Issue.3
-
-
Grégoire, E.1
Mazure, B.2
Piette, C.3
|