Scribd Logo
Upload

Welcome to Scribd!

  • 20 views

    Constraint Programming For Problem Solving 1.what Is Constraint Programming

    Uploaded by

    Pavithra Deepika
    Constraint programming is a technique for solving combinatorial problems that involves modeling problems as constraints and solving those constraints. It is used for problems in areas like scheduling, planning, optimization, natural language processing, computer graphics, and more. Constraint programming techniques include systematic search algorithms, consistency techniques, and additional space pruning techniques. Popular domains for constraint programming include boolean, integer, rational, finite, and mixed domains. Constraint programming languages include B-Prolog, CHIP, Ciao, ECLiPSe, and SICStus. The constraint satisfaction problem involves variables with finite domains and constraints restricting the combinations of values the variables can simultaneously take. Constraint programming offers advantages for solving combinatorial problems compared to other techniques.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd

    Constraint Programming For Problem Solving 1.what Is Constraint Programming

    Uploaded by

    Pavithra Deepika
    20 views3 pages
    Constraint programming is a technique for solving combinatorial problems that involves modeling problems as constraints and solving those constraints. It is used for problems in areas like scheduling, planning, optimization, natural language processing, computer graphics, and more. Constraint programming techniques include systematic search algorithms, consistency techniques, and additional space pruning techniques. Popular domains for constraint programming include boolean, integer, rational, finite, and mixed domains. Constraint programming languages include B-Prolog, CHIP, Ciao, ECLiPSe, and SICStus. The constraint satisfaction problem involves variables with finite domains and constraints restricting the combinations of values the variables can simultaneously take. Constraint programming offers advantages for solving combinatorial problems compared to other techniques.

    Original Description:

    j

    Original Title

    Clp Questions

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Constraint programming is a technique for solving combinatorial problems that involves modeling problems as constraints and solving those constraints. It is used for problems in areas like scheduling, planning, optimization, natural language processing, computer graphics, and more. Constraint programming techniques include systematic search algorithms, consistency techniques, and additional space pruning techniques. Popular domains for constraint programming include boolean, integer, rational, finite, and mixed domains. Constraint programming languages include B-Prolog, CHIP, Ciao, ECLiPSe, and SICStus. The constraint satisfaction problem involves variables with finite domains and constraints restricting the combinations of values the variables can simultaneously take. Constraint programming offers advantages for solving combinatorial problems compared to other techniques.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    20 views3 pages

    Constraint Programming For Problem Solving 1.what Is Constraint Programming

    Uploaded by

    Pavithra Deepika
    Constraint programming is a technique for solving combinatorial problems that involves modeling problems as constraints and solving those constraints. It is used for problems in areas like scheduling, planning, optimization, natural language processing, computer graphics, and more. Constraint programming techniques include systematic search algorithms, consistency techniques, and additional space pruning techniques. Popular domains for constraint programming include boolean, integer, rational, finite, and mixed domains. Constraint programming languages include B-Prolog, CHIP, Ciao, ECLiPSe, and SICStus. The constraint satisfaction problem involves variables with finite domains and constraints restricting the combinations of values the variables can simultaneously take. Constraint programming offers advantages for solving combinatorial problems compared to other techniques.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 3

    CONSTRAINT PROGRAMMING FOR PROBLEM SOLVING 1.

    What is Constraint Programming Constraint programming is the study of computational models and systems based on constraints. 2. Applications of Constraint Programming computer graphics (to express geometric coherence in the case of scene analysis), natural language processing (construction of efficient parsers), database systems (to ensure and/or restore consistency of the data), operations research problems (like optimization problems), molecular biology (DNA sequencing), business applications (option trading), electrical engineering (to locate faults), circuit design (to compute layouts), etc

    3.where Constraint programming mainly applied? Constraint programming is intended to solve computationally hard problems. These are combinatorial problems, graph-theoretic problems, optimization problems, and problems involving scheduling and planning. 4. list some Constraint Solving Methods A constraint is local but a solution to all constraints is global. Systematic Search Algorithms Consistency Techniques Additional Space Pruning Techniques 5.Some popular domains for constraint programming

    boolean domains, where only true/false constraints apply (SAT problem) integer domains, rational domains linear domains, where only linear functions are described and analyzed (although approaches to non-linear problems do exist) finite domains, where constraints are defined over finite sets mixed domains, involving two or more of the above

    6. Constraint logic languages



    B-Prolog (Prolog-based, proprietary) CHIP V5
    [1]

    (Prolog-based, also includes C++ and C libraries, proprietary)

    Ciao (Prolog-based, Free software: GPL/LGPL)

    ECLiPSe (Prolog-based, open source) SICStus (Prolog-based, proprietary)

    7 .Explain Constraint Satisfaction Constraint Satisfaction arose from the research in Artificial Intelligence (combinatorial problems, search) and Computer Graphics (SKETCHPAD system, expressing geometric coherence in the case of scene analysis). 8.What is CSP The Constraint Satisfaction Problem (CSP) is a problem where one is given:

    a finite set of variables, a function which maps every variable to a finite domain, a finite set of constraints.

    Each constraint restricts the combination of values that a set of variables may take simultaneously. A solution of a CSP is an assignment to each variable a value from its domain satisfying all the constraints. The task is to find one solution or all solutions. 9.Advantages of constraint technology British Airways, SAS, Swissair, French railway authority SNCF, Hong Kong International Terminals, Michelin, Dassault etc.

    puzzles (not really practical applications, but they are fun) o N-queens o Zebra (five house puzzle) o a crossword puzzle o cryptoarithmetics (SEND+MORE=MONEY) o mastermind graph coloring analysis and synthesis of analog circuits option trading analysis cutting stock DNA sequencing scheduling chemical hypothetical reasoning warehouse location forest treatment scheduling airport counter allocation (Cathay Pacific Airways Ltd) crew rostering problem (Italian Railway Company) well activity scheduling (Saga Petroleum a.s.)

    10. Constraint programming Active research areas Specialized conferences (CP, CP/AI-OR, )

    Journal (Constraints) Companies 11. How does it compare to integer programming? 12. How easy is it to use? 13.What is the underlying technology?

    You might also like