制約論ç†ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¶…入門â—制約プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã¯ï¼Ÿ 制約プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯ã€å¤‰æ•°ã®ç¯„囲や変数間ã®é–¢ä¿‚を制約ã¨ã„ã†å½¢ã§å®£è¨€çš„ã«è¨˜è¿°ã—ã¾ã™ã€‚ã“ã‚ŒãŒãƒ—ãƒã‚°ãƒ©ãƒ ã«ãªã‚Šã€ãれを「制約ソルãƒãƒ¼ã€ã§å®Ÿè¡Œã—ã€åˆ¶ç´„を満ãŸã™è§£ã‚’探索ã—ã¾ã™ã€‚制約プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®åˆ†é‡Žã¨ã—ã¦ã¯ã€æ•°ç†è¨ˆç”»æ³• (Mathematical Programing)ã€åˆ¶ç´„充足å•é¡Œ (CSP : Constraint Staisfaction Problem) や制約最é©åŒ–å•é¡Œ (COP : Constraint Optimization Problem) ãªã©ãŒã‚ã‚Šã¾ã™ã€‚ æ•°ç†è¨ˆç”»æ³•ã¯ã€å¤‰æ•°ã«é–¢ã™ã‚‹ä¸ç‰å¼ã‚„ç‰å¼ã§è¡¨ã•ã‚Œã‚‹åˆ¶ç´„ã®æ¡ä»¶ä¸‹ã§ã€ç›®çš„ã®é–¢æ•°ã‚’æœ€å° (ã‚ã‚‹ã„ã¯æœ€å¤§) ã«ã™ã‚‹å¤‰æ•°ã®å€¤ã‚’求ã‚ã‚‹å•é¡Œã§ã™ã€‚特ã«ã€åˆ¶ç´„æ¡ä»¶ã¨ç›®çš„関数ãŒç·šå½¢æ–¹ç¨‹å¼ã§è¡¨ã•ã‚Œã‚‹ã€Œç·šå½¢è¨ˆç”»æ³• (liner programming)ã€ã®åˆ†é‡Žã§ã¯ã€ã€Œå˜ä½“法 (simplex method)ã€ã¨ã„ã†é«˜é€Ÿ
ペンギンã®ç¾¤ã‚ŒãŒã™ã‚Œé•ã†ã¨ã©ã†ãªã‚‹ã®ã‹ï¼Ÿå¦èŠ¸å“¡ãŒæ’®å½±ã—ãŸæ˜ åƒã«ç¤¾ä¼šãŒæ„Ÿã˜ã‚‰ã‚Œã¦é¢ç™½ã„「最後ã®äºŒç¾½ãŒè‰¯ã„ã€
What are the main technical differences between Prolog and miniKanren, with respect to logic programming?
Learn Prolog Now!
{{#tags}}- {{label}}
{{/tags}}