Central Library

Normal view MARC view ISBD view

Constraint Solving and Planning with Picat [electronic resource] / by Neng-Fa Zhou, H�akan Kjellerstrand, Jonathan Fruhman.

By: Zhou, Neng-Fa [author.].
Contributor(s): Kjellerstrand, H�akan [author.] | Fruhman, Jonathan [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: SpringerBriefs in Intelligent Systems, Artificial Intelligence, Multiagent Systems, and Cognitive Robotics: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2015Description: XI, 148 p. 40 illus., 31 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319258836.Subject(s): Computer science | Computers | Data mining | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Theory of Computation | Data Mining and Knowledge DiscoveryAdditional physical formats: Printed edition:: No titleDDC classification: 006.3 Online resources: Click here to access online
Contents:
An Overview of Picat -- Basic Constraint Modeling -- Advanced Constraint Modeling -- Dynamic Programming with Tabling -- From Dynamic Programming to Planning -- Planning with Resource-Bounded Search -- Encodings for the Traveling Salesman Problem -- Index.
In: Springer eBooksSummary: This book introduces a new logic-based multi-paradigm programming language that integrates logic programming, functional programming, dynamic programming with tabling, and scripting, for use in solving combinatorial search problems, including CP, SAT, and MIP (mixed integer programming) based solver modules, and a module for planning that is implemented using tabling. The book is useful for undergraduate and graduate students, researchers, and practitioners.
    average rating: 0.0 (0 votes)
No physical items for this record

An Overview of Picat -- Basic Constraint Modeling -- Advanced Constraint Modeling -- Dynamic Programming with Tabling -- From Dynamic Programming to Planning -- Planning with Resource-Bounded Search -- Encodings for the Traveling Salesman Problem -- Index.

This book introduces a new logic-based multi-paradigm programming language that integrates logic programming, functional programming, dynamic programming with tabling, and scripting, for use in solving combinatorial search problems, including CP, SAT, and MIP (mixed integer programming) based solver modules, and a module for planning that is implemented using tabling. The book is useful for undergraduate and graduate students, researchers, and practitioners.

There are no comments for this item.

Log in to your account to post a comment.