메뉴 건너뛰기




Volumn 4741 LNCS, Issue , 2007, Pages 317-331

MUST: Provide a finer-grained explanation of unsatisfiability

Author keywords

Constraint networks; CSP; Explanation; MUC; MUS; MUST; Unsatisfiability

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATION THEORY; CONSTRAINT THEORY;

EID: 38149075300     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_24     Document Type: Conference Paper
Times cited : (23)

References (28)
  • 3
    • 0026940077 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 11
    • 0001372340 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 17
    • 0004107567 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 20
    • 0042014224 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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)
  • 25
    • 26444450510 scopus 로고    scopus 로고
    • 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)
  • 27
    • 38149062206 scopus 로고    scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.