메뉴 건너뛰기




Volumn 6876 LNCS, Issue , 2011, Pages 325-339

On minimal constraint networks

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CONSTRAINT NETWORK; CONSTRAINT NETWORKS; CONSTRAINT RELATIONS; NP-HARD;

EID: 80053013860     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23786-7_26     Document Type: Conference Paper
Times cited : (9)

References (13)
  • 1
    • 36349013336 scopus 로고    scopus 로고
    • Constraint propagation
    • Rossi, F., van Beek, P., Walsh, T. (eds.) ch. 3
    • Bessiere, C.: Constraint propagation. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, ch. 3, pp. 29-83 (2006)
    • (2006) Handbook of Constraint Programming , pp. 29-83
    • Bessiere, C.1
  • 3
    • 0026868943 scopus 로고
    • From local to global consistency
    • Dechter, R.: From local to global consistency. Artif. Intell. 55(1), 87-108 (1992)
    • (1992) Artif. Intell. , vol.55 , Issue.1 , pp. 87-108
    • Dechter, R.1
  • 5
    • 0000079650 scopus 로고
    • Structure identification in relational data
    • Dechter, R., Pearl, J.: Structure identification in relational data. Artif. Intell. 58, 237-270 (1992)
    • (1992) Artif. Intell. , vol.58 , pp. 237-270
    • Dechter, R.1    Pearl, J.2
  • 7
    • 80053029633 scopus 로고
    • Master of Science (MSc) Thesis, Simon Fraser University April Currently available at
    • Gaur, D.R.: Algorithmic complexity of some constraint satisfaction problems, Master of Science (MSc) Thesis, Simon Fraser University (April 1995), Currently available at: http://ir.lib.sfu.ca/bitstream/1892/7983/1/b17427204.pdf
    • (1995) Algorithmic Complexity of Some Constraint Satisfaction Problems
    • Gaur, D.R.1
  • 8
    • 0021828305 scopus 로고
    • The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
    • Mackworth, A., Freuder, E.: The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artif. Intelligence 25(1), 65-74 (1985)
    • (1985) Artif. Intelligence , vol.25 , Issue.1 , pp. 65-74
    • Mackworth, A.1    Freuder, E.2
  • 10
    • 0019624806 scopus 로고
    • On the complexity of testing implications of functional and join dependencies
    • Maier, D., Sagiv, Y., Yannakakis, M.: On the complexity of testing implications of functional and join dependencies. J. ACM 28(4), 680-695 (1981)
    • (1981) J. ACM , vol.28 , Issue.4 , pp. 680-695
    • Maier, D.1    Sagiv, Y.2    Yannakakis, M.3
  • 11
    • 0016050041 scopus 로고
    • Networks of constraints: Fundamental properties and applications to picture processing
    • Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences 7, 95-132 (1974)
    • (1974) Information Sciences , vol.7 , pp. 95-132
    • Montanari, U.1
  • 12
    • 0004518750 scopus 로고
    • Fundamental properties of networks of constraints: A new formulation
    • Kanal, L., Kumar, V. (eds.)
    • Montanari, U., Rossi, F.: Fundamental properties of networks of constraints: A new formulation. In: Kanal, L., Kumar, V. (eds.) Search in Artificial Intelligence, pp. 426-449 (1988)
    • (1988) Search in Artificial Intelligence , pp. 426-449
    • Montanari, U.1    Rossi, F.2


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