Constraint Solving and Planning with Picat
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
- PDF / 2,808,893 Bytes
- 155 Pages / 439.37 x 666.142 pts Page_size
- 70 Downloads / 211 Views
Neng-Fa Zhou Håkan Kjellerstrand Jonathan Fruhman
Constraint Solving and Planning with Picat 123
SpringerBriefs in Intelligent Systems Artificial Intelligence, Multiagent Systems, and Cognitive Robotics
Series editors Gerhard Weiss, Maastricht, The Netherlands Karl Tuyls, Liverpool, UK
More information about this series at http://www.springer.com/series/11845
Neng-Fa Zhou Håkan Kjellerstrand Jonathan Fruhman •
Constraint Solving and Planning with Picat
123
Neng-Fa Zhou Department of Computer and Information Science Brooklyn College Brooklyn, NY USA
Jonathan Fruhman Independent Researcher New York, NY USA
Håkan Kjellerstrand hakank.org Malmö Sweden
ISSN 2196-548X ISSN 2196-5498 (electronic) SpringerBriefs in Intelligent Systems Artificial Intelligence, Multiagent Systems, and Cognitive Robotics ISBN 978-3-319-25881-2 ISBN 978-3-319-25883-6 (eBook) DOI 10.1007/978-3-319-25883-6 Library of Congress Control Number: 2015954588 Springer Cham Heidelberg New York Dordrecht London © The Author(s) 2015 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. Printed on acid-free paper Springer International Publishing AG Switzerland is part of Springer Science+Business Media (www.springer.com)
Foreword
Logic programming languages entered the scene of computer science in the early 1970s as the answer to the need for paradigms capable of representing and reasoning about different kinds of knowledge. The big picture that was pursued by logic programming researchers was to create a black-box system that is able to transform declarative and logic-based specifications into actionable problem solutions (“the holy grail of programming,” as some authors say). The history of logic programming witnessed periods of genuine enthusiasm and leaps of knowledge, and also witnessed periods of stagnation. The initial proposal of the language Prolog by Robert Kowalski came with the drawback of the inefficiency of its first implementation of the SLD resolution procedure. As a consequence, the AI communit
Data Loading...
