메뉴 건너뛰기




Volumn 3258, Issue , 2004, Pages 123-137

Leveraging the learning power of examples in automated constraint acquisition

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LEARNING SYSTEMS; PROBLEM SOLVING; SEMANTICS;

EID: 35048898849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_12     Document Type: Article
Times cited : (52)

References (10)
  • 1
    • 35248881926 scopus 로고    scopus 로고
    • Propagation redundancy in redundant modelling
    • Proceedings of CP-2003, Springer, September
    • C.W. Choi, J.H.M. Lee, and P.J. Stuckey. Propagation redundancy in redundant modelling. In Proceedings of CP-2003, volume LNCS 2833, pages 229-243. Springer, September 2003.
    • (2003) LNCS , vol.2833 , pp. 229-243
    • Choi, C.W.1    Lee, J.H.M.2    Stuckey, P.J.3
  • 3
    • 0003728463 scopus 로고
    • Removing redundancies in constraint networks
    • A. Dechter and R. Dechter. Removing redundancies in constraint networks. In Proceedings of AAAI-87, pages 105-109, 1987.
    • (1987) Proceedings of AAAI-87 , pp. 105-109
    • Dechter, A.1    Dechter, R.2
  • 4
    • 0031077510 scopus 로고    scopus 로고
    • Local and global relational consistency
    • R. Dechter and P. van Beek. Local and global relational consistency. Theoretical Computer Science, 173(1):283-308, 1997.
    • (1997) Theoretical Computer Science , vol.173 , Issue.1 , pp. 283-308
    • Dechter, R.1    Van Beek, P.2
  • 5
    • 49449120803 scopus 로고
    • Consistency in networks of relations
    • A. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99-118, 1977.
    • (1977) Artificial Intelligence , vol.8 , pp. 99-118
    • Mackworth, A.1
  • 6
    • 0000531852 scopus 로고
    • Generalization as search
    • T. Mitchell. Generalization as search. Artificial Intelligence, 18(2):203-226, 1982.
    • (1982) Artificial Intelligence , vol.18 , Issue.2 , pp. 203-226
    • Mitchell, T.1
  • 7
    • 0033536221 scopus 로고    scopus 로고
    • Determining computational complexity from characteristic 'phase transition'
    • R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Ttroyansky. Determining computational complexity from characteristic 'phase transition'. Nature, 400:133-137, 1999.
    • (1999) Nature , vol.400 , pp. 133-137
    • Monasson, R.1    Zecchina, R.2    Kirkpatrick, S.3    Selman, B.4    Ttroyansky, L.5
  • 8
    • 0003071129 scopus 로고
    • Generalization and learnability: A study of constrained atoms
    • S.H.. Muggleton, editor
    • C.D. Page and A.M. Frisch. Generalization and learnability: A study of constrained atoms. In S.H.. Muggleton, editor, Inductive Logic Programming, pages 29-61. 1992.
    • (1992) Inductive Logic Programming , pp. 29-61
    • Page, C.D.1    Frisch, A.M.2
  • 9
    • 0005365017 scopus 로고    scopus 로고
    • Delaying the choice of bias: A disjunctive version space approach
    • M. Sebag. Delaying the choice of bias: A disjunctive version space approach. In Proceedings of ICML-1996, pages 444-452, 1996.
    • (1996) Proceedings of ICML-1996 , pp. 444-452
    • Sebag, M.1
  • 10
    • 33746066692 scopus 로고    scopus 로고
    • Succeed-first or fail-first: A case study in variable and value ordering
    • B.M. Smith. Succeed-first or fail-first: A case study in variable and value ordering. In Proceedings of PACT-1997, pages 321-330, 1997.
    • (1997) Proceedings of PACT-1997 , pp. 321-330
    • Smith, B.M.1


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