Zhou, Neng-Fa.
Constraint Solving and Planning with Picat [electronic resource] / by Neng-Fa Zhou, H�akan Kjellerstrand, Jonathan Fruhman. - XI, 148 p. 40 illus., 31 illus. in color. online resource. - SpringerBriefs in Intelligent Systems, Artificial Intelligence, Multiagent Systems, and Cognitive Robotics, 2196-548X . - SpringerBriefs in Intelligent Systems, Artificial Intelligence, Multiagent Systems, and Cognitive Robotics, .
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.
9783319258836
10.1007/978-3-319-25883-6 doi
Computer science.
Computers.
Data mining.
Artificial intelligence.
Computer Science.
Artificial Intelligence (incl. Robotics).
Theory of Computation.
Data Mining and Knowledge Discovery.
Q334-342 TJ210.2-211.495
006.3
Constraint Solving and Planning with Picat [electronic resource] / by Neng-Fa Zhou, H�akan Kjellerstrand, Jonathan Fruhman. - XI, 148 p. 40 illus., 31 illus. in color. online resource. - SpringerBriefs in Intelligent Systems, Artificial Intelligence, Multiagent Systems, and Cognitive Robotics, 2196-548X . - SpringerBriefs in Intelligent Systems, Artificial Intelligence, Multiagent Systems, and Cognitive Robotics, .
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.
9783319258836
10.1007/978-3-319-25883-6 doi
Computer science.
Computers.
Data mining.
Artificial intelligence.
Computer Science.
Artificial Intelligence (incl. Robotics).
Theory of Computation.
Data Mining and Knowledge Discovery.
Q334-342 TJ210.2-211.495
006.3