Overview
- Appropriate for undergraduate and graduate students, researchers, and practitioners
- Authors combine academic and practical developer community experience
- Exercises encourage readers to practice the presented modeling techniques
- Includes supplementary material: sn.pub/extras
Part of the book series: SpringerBriefs in Intelligent Systems (BRIEFSINSY)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents(7 chapters)
About this book
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.
Authors and Affiliations
-
Dept. of Computer and Information Scienc, Brooklyn College, Brooklyn, USA
Neng-Fa Zhou
-
hakank.org, Malmö, Sweden
Håkan Kjellerstrand
-
Independent Researcher , BROOKLYN, USA
Jonathan Fruhman
Bibliographic Information
Book Title: Constraint Solving and Planning with Picat
Authors: Neng-Fa Zhou, Håkan Kjellerstrand, Jonathan Fruhman
Series Title: SpringerBriefs in Intelligent Systems
DOI: https://doi.org/10.1007/978-3-319-25883-6
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: The Author(s) 2015
Softcover ISBN: 978-3-319-25881-2Published: 16 November 2015
eBook ISBN: 978-3-319-25883-6Published: 07 November 2015
Series ISSN: 2196-548X
Series E-ISSN: 2196-5498
Edition Number: 1
Number of Pages: XI, 148
Number of Illustrations: 9 b/w illustrations, 31 illustrations in colour
Topics: Artificial Intelligence, Theory of Computation, Data Mining and Knowledge Discovery